What is the sum of the digits of the smallest prime that can be written as a sum of distinct primes?
- A)
- B)
- C)
- D)
- E)
Answer
B
Key insight
If 2 is one of the five primes, the total is even and cannot be prime. So use five odd primes, and try the smallest totals first.
Solution
1. Should be one of the five primes? Every prime except is odd. If is used, the other four primes are odd, and four odd numbers add to an even number. Then the total is even plus , which is even. An even number bigger than is not prime. So cannot be used, and all five primes are odd.
2. Try the smallest choice. The five smallest odd primes are :
But , so it is not prime.
3. The next prime is . Can we reach it? Any other set of five odd primes has to use a prime of at least (because it cannot be exactly ). The other four primes add to at least . So the total is at least . That means (and , ) cannot be reached.
4. Try . It works: , and is prime.
5. Answer the question asked. The smallest such prime is , and its digits add to .
The answer is .
Why this works
Odd and even decide the first step: an odd total built from five primes cannot include . After that, finding the "smallest" is a matter of starting at the smallest possible total and checking the next few numbers one at a time. Read the last line of the question again at the end: it wants the sum of the digits, not the prime.
The trap
Answering with the prime 43 itself (or with 39, which is not prime) instead of its digit sum 7, or using 2 and getting an even total.
Concise solution
If were one of the five primes, the sum would be plus four odd numbers, which is even and larger than , hence not prime. So all five primes are odd.
The smallest five odd primes give , not prime.
Can the sum be ? Any five distinct odd primes other than must include a prime that is at least , and the other four add to at least , so the total is at least . Thus is impossible.
And works: , which is prime.
The digit sum of is , so the answer is .
Review in the AoPS books
- Introduction to Number Theory, Chapter 2: Primes and Composites
- Prealgebra, Chapter 15: Problem-Solving Strategies (§15.2)
- Introduction to Number Theory, Chapter 4: Prime Factorization (§4.2, §4.4)
Techniques
Organized listing / direct enumeration · Use an invariant, parity, or coloring argument