Browse · harp
Printsmc
number theory senior
Problem
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?
(A)
(B)
(C)
(D)
Solution
Neither of the digits , , and can be a units digit of a prime. Therefore the sum of the set is at least . We can indeed create a set of primes with this sum, for example the following sets work: or . Thus the answer is .
Final answer
B