2003 CEMC Pascal Problems/Problem 9
Problem
The largest prime number less than 30 that can be written as the sum of two primes is
Solution 1
We can see that must be one of the primes included in the sum because
is the only even prime number, and adding two odd numbers would result in an even number.
Listing all of the primes above that are below
we have
.
, which goes above
, so we can get rid of it.
Of the remaining primes, the only ones that are still prime when added to are:
The highest number here is , and
~anabel.disher
Solution 2
We can use the same logic as solution 1 to deduce that one of the prime numbers is . This means that we can just subtract
from the answer choices and go from highest to lowest until we get a prime number:
, which is divisible by
, so it is not prime
, which is divisible by
, so it is not prime
, which is prime
Thus, is the answer
~anabel.disher