Every Even Number, Two Primes
The puzzle
Write 100 as the sum of two primes. Then 1,000. Then convince yourself every even number above 2 can be done.
What is the status of that last claim?
Stuck?
One at a time, smallest first. Open only as many as you need — the whole point of the puzzle is the part you work out yourself.
Hint 1
Start from the small primes and subtract: is 100 − 3 prime? 100 − 11?
Hint 2
Being true for every number anybody has checked is not the same as being proved.
Show the answer Hide the answer
100 = 3 + 97, and also 11 + 89, 17 + 83, 29 + 71, 41 + 59, 47 + 53. The general claim is Goldbach's conjecture, open since 1742.
How to get there
For 100, subtract each small prime and test what remains: 100 − 3 = 97, prime. There are six such pairs in all. For 1,000 there are 28, including 3 + 997.
The number of representations tends to GROW with the size of the even number, which is why the conjecture looks so safe. It has been verified by computer past 4 × 10^18.
None of that is a proof. The weak version - every odd number above 5 is a sum of three primes - was proved by Helfgott in 2013, and Chen showed in 1973 that every large even number is a prime plus a number with at most two prime factors. The full statement remains open, and verifying more cases will never settle it.
The technique worth keeping
Checking cases builds confidence and proves nothing about infinitely many. When a pattern holds for every value tested, the useful question is whether an argument covers ALL values - and if not, the statement is a conjecture however many cases have passed.