Template:Weeklyproblem
Problem of the Week
2002 AMC 12A, Problem 17
Several sets of prime numbers, such as
use each of the nine nonzero digits exactly once. What is the smallest possible sum such a set of primes could have?
2002 AMC 12A, Problem 17
Several sets of prime numbers, such as
use each of the nine nonzero digits exactly once. What is the smallest possible sum such a set of primes could have?
Something appears to not have loaded correctly.