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
Using 2 makes the sum even, so take five odd primes; 3+5+7+11+13 = 39 is composite, 41 is unreachable, and 3+5+7+11+17 = 43 is prime.
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 .
Why this works
Parity decides the first step: an odd target sum of five primes cannot contain the lone even prime . After that, "smallest" is a bounding argument: start from the minimal candidate and show each smaller value is out of reach before exhibiting the one that works. Always finish by answering the question actually asked (the digit sum, not the prime).
The trap
Reporting the prime 43 (or the composite 39) instead of its digit sum 7, or including 2 and getting an even sum.
Common mistakes
- Reporting the prime 43 (or the composite 39) instead of its digit sum 7, or including 2 and getting an even sum.
- Declaring prime without checking; .
Techniques
Organized listing / direct enumeration · Use an invariant, parity, or coloring argument