Let be the largest integer that is the product of exactly 3 distinct prime numbers , , and , where and are single digits. What is the sum of the digits of ?
- A)
- B)
- C)
- D)
- E)
Answer
A
Key insight
Only e = 3 or 7 lets 10d + e be prime; the four survivors 23, 37, 53, 73 make 7 * 3 * 73 = 1533 the largest product.
Solution
The single-digit primes are , so and come from this set and are distinct.
For the two-digit number to be prime, its units digit cannot be or , so . Check the candidates:
- : (prime), (prime), (prime).
- : (no), (prime), (no).
The possible products are
The largest is , whose digit sum is .
The answer is .
Why this works
The search space is tiny once you use the structure: only four single-digit primes exist, and a two-digit prime's last digit is restricted. A short organized list beats guessing that "the biggest wins," which happens to be true here but needs the check that is prime while and are not.
The trap
Allowing e = 5 or e = 2 (75 or 72 are not prime) or picking d = e = 7, which violates 'distinct' and gives the non-prime 77.
Common mistakes
- Allowing e = 5 or e = 2 (75 or 72 are not prime) or picking d = e = 7, which violates 'distinct' and gives the non-prime 77.
- Reporting the digit sum of the primes () or of rather than of the product .
Techniques
Bound the quantity above/below or estimate to pin it down · Organized listing / direct enumeration