Skip to content
OneKitly

Every Even Number Ever Tested Is Two Primes Added Together

Published 10/26/2026 · 3 min read · Everyday calculators

Daniel Okonkwo

Daniel Okonkwo — Front-end developer and tech writer at OneKitly

Web performance · File formats

Checked against 2 sources

View profile →
In short

The conjecture says that every even number greater than two can be written as the sum of two primes, and it is trivial to check for any particular number: 6 is 3 + 3, 100 is 3 + 97, a thousand is 3 + 997, ten thousand is 59 + 9,941. Nobody has ever found an even number that fails, and computers have now checked every one up to bounds with eighteen digits. That is a great deal of evidence and no proof at all, which is the entire difficulty. The statement was written in a letter in 1742 and has resisted everything since, while related but weaker results — every odd number large enough is a sum of three primes, every even number is a prime plus a number with at most two prime factors — have been settled.

Advertisement

100 = 3 + 97, 1,000 = 3 + 997, 10,000 = 59 + 9,941. The claim has held for every even number checked since 1742 and has never been proved.

The number of ways grows, which makes failure look unlikely

A small even number has one or two decompositions and a large one has many: the count rises steadily with size, because there are more primes below a big number and more ways to pair them. That growth is the heuristic reason nobody expects a counterexample — for the conjecture to fail, some particular even number would have to miss every one of its thousands of candidate pairings simultaneously, which would be an extraordinary coincidence. Extraordinary coincidences are exactly what a proof is supposed to rule out, and the heuristic cannot do that job.

Two versions, one settled and one not

The weak or ternary form says every odd number above five is the sum of three primes, and that one was proved in 2013 after a long campaign of partial results and computer verification of the small cases. It follows from the strong form immediately — take an odd number, subtract three, and apply the strong statement to what is left — so proving the strong version would have given the weak one for free. Going the other way is not possible, which is why the harder statement remains where it was. The pattern is common in number theory: the version with more room to manoeuvre falls first.

One decomposition each
Even numberAs two primes
63 + 3
1003 + 97
1,0003 + 997
10,00059 + 9,941
Goldbach conjecture verifierGoldbach's conjecture says every even number above 2 is the sum of two primes. Enter an even number and it finds such a pair (the one with the smallest first prime), confirming the conjecture for that value.Try the tool →
Advertisement

Frequently asked questions

Why does the check start at four?
Because two is the only even prime and the smallest even number available. Four is 2 + 2, the first case, and everything below it is either odd or not a sum of two primes for uninteresting reasons. The exclusion of two itself from the statement is the usual tidying-up that number theory does around its one even prime, which spoils a great many otherwise clean claims and is the reason so many results say "odd prime" rather than "prime".
Would a counterexample be easy to recognise?
Yes, and that asymmetry is worth noticing. Disproving the conjecture requires exhibiting one even number and showing that none of its pairings works, which is a finite check anyone could verify. Proving it requires an argument covering infinitely many numbers at once. Statements of this shape — easy to refute, hard to establish — are common, and their long survival under computational attack is genuine evidence for them precisely because refutation would have been so cheap if it were available.

Articles you may find interesting

All guides →

Related tools

Sources

Spotted a mistake in this article?