Browse · harp
Printimc
number theory intermediate
Problem
The positive difference between a pair of primes is equal to , and the positive difference between the cubes of the two primes is . What is the sum of the digits of the least prime that is greater than those two primes?
(A)
(B)
(C)
(D)
(E)
Solution
Let the two primes be and . We would have and . Using difference of cubes, we would have . Since we know is equal to , would become . Simplifying more, we would get . Now let's introduce another variable. Instead of using and , we can express the primes as and where is and b is . Plugging and in, we would have . When we expand the parenthesis, it would become . Then we combine like terms to get which equals . Then we subtract 4 from both sides to get . Since all three numbers are divisible by 3, we can divide by 3 to get . Notice how if we add 1 to both sides, the left side would become a perfect square trinomial: which is . Since is too small to be a valid number, the two primes must be odd, therefore is the number in the middle of them. Conveniently enough, so the two numbers are and . The next prime number is , and so the answer is . A note: If you aren't entirely familiar with square trinomials, after we have , we can simply guess and check from here. We know that , and we notice that for , must be a odd number. Thus we can guess that =71, which proves to be right. Continuing, we then know the larger prime is 73, and we know that 75 and 77 aren't primes, so thus our next bigger prime is 79, and 7+9=16. Thus the answer is .
Final answer
E