Using the digits 1, 2, 3, 4, 5, 6, 7, and 9, form 4 two-digit prime numbers, using each digit only once. What is the sum of the 4 prime numbers?
- A)
- B)
- C)
- D)
- E)
Answer
E
Key insight
A two-digit prime cannot end in an even digit or in 5, so 1, 3, 7, 9 must be the last digits and 2, 4, 5, 6 the first digits.
Solution
We don't actually need to find the four primes. We only need to know which digits are in the tens place and which are in the ones place.
- Last digits. A two-digit number ending in is even, and one ending in is a multiple of , so none of those are prime. A two-digit prime must end in or .
- Our digits include exactly four of these: . Four primes need four last digits, so these four are the last digits.
- First digits. The remaining digits, , must be the tens digits.
4. Add by place value. Each tens digit is worth ten times itself:
This does not depend on how the digits are paired.
- Make sure it is possible. For example , , , are all prime and use each digit once, and indeed .
The answer is .
Why this works
The sum of some two-digit numbers depends only on which digits are tens digits and which are ones digits, not on how they are matched up. Rules for divisibility by and decide the ones digits completely. When a problem asks only for a total, look for what stays the same no matter how the unknown choices are made.
The trap
Spending time hunting for the four actual primes. The sum is the same however the digits are paired.
Concise solution
A two-digit prime is odd and not a multiple of , so its units digit must be , , or . The eight given digits contain exactly four of these, namely , and four primes need four units digits, so these are the units digits. The other four digits, , must all be tens digits.
Whatever the pairing, the sum of the four numbers is
(Such a pairing does exist, for example , so the problem is consistent.)
The answer is .
Review in the AoPS books
- Introduction to Number Theory, Chapter 2: Primes and Composites
- Introduction to Number Theory, Chapter 8: Base Numbers
- Introduction to Number Theory, Chapter 4: Prime Factorization (§4.2, §4.4)
- Introduction to Number Theory, Chapter 9: Base Number Arithmetic
Techniques
Set up the equation/formula and compute; no special trick needed · Use an invariant, parity, or coloring argument