100 = 3 + 97 = 11 + 89 = 17 + 83 = 29 + 71 = 41 + 59 = 47 + 53: six ways of writing it as the sum of two primes, and no seventh. The first link adds the partition with the smallest and the largest of the six primes and prints 100; the next three take one prime away from 100 and print its partner — 97, 89 and 59 — each of which is itself prime, which is the whole of what the conjecture demands. Six partitions is generous for a number this size, and the reason is simply that 100 is even and large enough: the Hardy–Littlewood estimate for the count of representations grows like n over the square of its logarithm, so the number of ways climbs steadily with the number.
Goldbach wrote to Euler in 1742 and Euler replied that it was 'a most excellent theorem, although I am unable to prove it'; three centuries later nobody can either. What has been done instead is to surround it. Helfgott proved in 2013 that every odd number greater than five is the sum of three primes, which is the weak conjecture and follows from the hard work of Vinogradov on large odd numbers. Schnirelmann showed in 1930 that some bounded number of primes sums to every integer, and the bound has come down steadily since: Helfgott's theorem gives four primes for every even number, because an even n is 3 plus three primes as soon as n − 3 is odd and bigger than five. Chen's theorem is the other kind of progress — every large even number is a prime plus a number with at most two prime factors. Machine verification has reached 4⋅10^18, so a counterexample — if there is one — is larger than anything a person has written down by hand in the entire history of arithmetic.
Answer
100
How to read it
The sum of the first partition. The other three links subtract a prime from 100 and leave its partner, which had better be prime.
Source
Christian Goldbach's letter to Euler of 7 June 1742; the even case has been verified by Oliveira e Silva, Herzog and Pardi up to 4⋅10^18, and the strongest proved statement is Helfgott's 2013 proof of the ternary (odd) conjecture
Work it in the calculator
These links open the right calculator with this problem's numbers already typed in. The line above is what the screen should show — check it yourself.