Goldbach Conjecture Explained: Is It Proved?
Quick answer: Goldbach’s conjecture says every even number greater than 2 is the sum of two primes: 4 = 2 + 2, 28 = 5 + 23, 100 = 3 + 97. Christian Goldbach proposed it in a 1742 letter to Leonhard Euler. It has been checked by computer up to 4 × 10^18 but never proved. The weaker “ternary” version, that every odd number above 5 is a sum of three primes, was proved by Harald Helfgott in 2013.
Take any even number bigger than 2. Can you write it as a sum of two primes? Try 10: \(3 + 7\) or \(5 + 5\). Try 28: \(5 + 23\) or \(11 + 17\). It always seems to work, and the more you look, the more ways you find. Yet after nearly 300 years, nobody can prove it always works.
The Conjecture
Strong (binary) Goldbach conjecture: every even integer greater than 2 is the sum of two primes.
| Even number | Ways as a sum of two primes |
|---|---|
| 4 | 2 + 2 |
| 10 | 3 + 7, 5 + 5 |
| 28 | 5 + 23, 11 + 17 |
| 100 | 3 + 97, 11 + 89, 17 + 83, 29 + 71, 41 + 59, 47 + 53 |
The number of ways tends to grow as numbers get bigger, which is why most mathematicians are confident it is true. A plot of the counts forms a pattern nicknamed Goldbach’s comet.
Where Did It Come From?
The problem grew out of Goldbach’s 1742 correspondence with Euler. On June 7, 1742, Christian Goldbach wrote to Leonhard Euler suggesting that every integer greater than 2 is a sum of three primes (at the time, 1 was often counted as prime). Euler replied that this would follow from the statement that every even number is a sum of two primes, which he believed but could not prove. That is the version we call Goldbach’s conjecture today.
What Has Been Proved?
| Year | Result | Who |
|---|---|---|
| 1937 | Every sufficiently large odd number is a sum of three primes | Ivan Vinogradov |
| 1973 | Every sufficiently large even number is a prime plus either a prime or a product of two primes | Chen Jingrun |
| 2013 | Every odd number greater than 5 is a sum of three primes (weak Goldbach) | Harald Helfgott |
| 2012 (published 2014) | Strong Goldbach checked for all even numbers up to \(4 \times 10^{18}\) (the published verification) | Oliveira e Silva, Herzog and Pardi |
| November 2026 | Helfgott’s proof of weak Goldbach reported formally verified, with two published finite computations (a range of GRH verification by Platt and binary Goldbach up to \(4 \times 10^{18}\)) kept as inputs | Reported by Quanta Magazine |
| November 2026 | Conditional result for sufficiently large even numbers, assuming GRH plus an extra spectral hypothesis | Jiamin Li and Jianya Liu (announcement) |
The weak conjecture follows from the strong one (subtract 3 from an odd number and split the even remainder), but not the other way around, so the strong version is still open.
Why Is It So Hard?
Primes are defined by multiplication, but Goldbach asks about addition. Methods like the circle method work well for sums of three primes, where there is room to average, but break down for two primes. Proving it would need control over how primes pair up that current tools do not give.
Common Misconceptions
“Computers proved it up to a huge number, so it is proved.” Checking is evidence, not proof.
“AI proved Goldbach in 2026.” No verified proof of the strong conjecture exists as of November 2026. Be cautious with viral claims; check whether they concern a variant.
Watch: Goldbach’s Conjecture in Video
If you learn better by watching, these videos are worth your time.
Check Your Understanding
Five quick questions to see how much of this has stuck. Pick an answer and press Submit; you will see a short explanation either way.
Answer each question and press Submit to see your result right away.
Frequently Asked Questions
What is Goldbach’s conjecture?
It states that every even integer greater than 2 can be written as the sum of two prime numbers, for example 28 = 5 + 23.
Has Goldbach’s conjecture been proved?
The strong (two-prime) conjecture is unproved as of November 2026. It has been checked up to 4 × 10^18. The weak (three-prime) version was proved by Harald Helfgott in 2013.
What is the weak Goldbach conjecture?
It says every odd number greater than 5 is the sum of three primes. Helfgott proved it in 2013, and a formal verification of his proof, relying on two published finite computations as inputs, was reported in November 2026.
Is there a prize for proving Goldbach’s conjecture?
In 2000, the publishers Faber and Faber and Bloomsbury offered 1 million dollars for a proof within two years as a book promotion; it expired unclaimed. There is no standing prize.
Keep Exploring
- Twin Prime Conjecture Explained: Is It Proven?
- Quasi-Riemann Hypothesis Explained: OpenAI’s Proof
- Largest Known Prime Number (2026): 41,024,320 Digits
Sources and Further Reading
Related to This Article
More math articles
- 8th Grade Georgia Milestones Assessment System Math FREE Sample Practice Questions
- How to Use Integers to Complete Equations
- Waist-to-Height Ratio Calculator
- Reading Tables, Percentages, and Graphs
- The Best HiSET Math Worksheets: FREE & Printable
- Tehran, Yalta, Potsdam, Bretton Woods and the United Nations
- Migration, Direction, Selection, and Policy
- The Ultimate NYSTCE Grades 1-6 Math (222) Course (+FREE Worksheets & Tests)
- 3rd Grade Georgia Milestones Assessment System Math Worksheets: FREE & Printable
- The Best Grade 5 Math Book for California Students


What people say about "Goldbach Conjecture Explained: Is It Proved? - Effortless Math"?
No one replied yet.