Let be the least positive integer that cannot be expressed as either the sum or difference of two primes , and let be the least positive composite integer that cannot be expressed as either the sum or difference of two primes.
Find .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Goldbach's conjecture would have that every even integer > 2 can be expressed as the sum of two primes. Now while this conjecture has not been proved, it has been confirmed up to 4 × 1 0 1 8 , so we don't need to be looking for even numbers just yet, including 2 = 5 − 3 . Now every odd integer up to 2 1 is ± 2 with respect to a prime, but not 2 3 , as neither 2 1 nor 2 5 is prime. Since the sum of two odd primes is always even, we can conclude that P = 2 3 , notably the first odd non-twin prime.
Now for Q we are again not looking for even numbers just yet. For odd integers, unless a prime gap exceeds 6 , any odd composite will be within 2 of a prime, so we are looking for the first prime gap that is 8 or more. This occurs between 8 9 and 9 7 , with the odd composite 9 3 = 3 × 3 1 differing by 4 from each of its prime neighbors. Thus Q = 9 3 , and so Q − P = 9 3 = 2 3 = 7 0 .