2002 AMC 12A Problems/Problem 17: Difference between revisions
No edit summary |
|||
| Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
Several sets of prime numbers, such as <math>\{7,83,421,659\}</math> use each of the nine nonzero digits exactly once. What is the smallest possible sum such a set of primes could have? | <!-- don't remove the following tag, for PoTW on the Wiki front page--><onlyinclude>Several sets of prime numbers, such as <math>\{7,83,421,659\}</math> use each of the nine nonzero digits exactly once. What is the smallest possible sum such a set of primes could have?<!-- don't remove the following tag, for PoTW on the Wiki front page--></onlyinclude> | ||
<math> | <math> | ||
Revision as of 17:54, 27 March 2015
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?
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 set works: 
.
Thus the answer is 
.
See Also
| 2002 AMC 12A (Problems • Answer Key • Resources) | |
| Preceded by Problem 16 |
Followed by Problem 18 |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | |
| All AMC 12 Problems and Solutions | |
These problems are copyrighted © by the Mathematical Association of America, as part of the American Mathematics Competitions. Error creating thumbnail: Unable to save thumbnail to destination
