Who was Christian Goldbach and how did the conjecture get its name?

Christian Goldbach was a Prussian mathematician in the early 1700s who corresponded with other mathematicians like Euler. He proposed related ideas in a letter, and Euler refined it into the conjecture that now bears Goldbach's name.

What is the difference between the weak and strong Goldbach conjectures?

The strong conjecture states every even number > 2 is the sum of two primes. The weak conjecture states every odd number > 5 is the sum of three primes. Proving the strong conjecture automatically proves the weak one.

Has the Goldbach conjecture been proven?

The strong Goldbach conjecture remains unproven. However, the weak Goldbach conjecture was proven by Harald Helfgott in 2013.

What was Chen Jingrun's contribution to Goldbach's conjecture?

Chen Jingrun proved that every sufficiently large even number can be written as the sum of a prime and a semiprime (a number that is the product of two primes). This was the closest anyone had come to proving the strong conjecture.

Why is proving the strong Goldbach conjecture so difficult?

The strong conjecture is significantly harder because the methods used to prove the weak conjecture, like the circle method, don't directly apply. New techniques are needed as the main contributions seem to come from the 'minor arcs' rather than the 'major arcs'.

Has any counterexample to the Goldbach conjecture ever been found?

Despite extensive computer checks up to four quintillion, no counterexample to the Goldbach conjecture has ever been found. This suggests it is likely true, but a formal proof for the strong version is still missing.

Does Goldbach's conjecture have practical applications?

Currently, solving Goldbach's conjecture is not known to have direct applications to the real world or other areas of mathematics. Its pursuit is primarily driven by fundamental mathematical curiosity and the challenge it presents.

Key Moments

The Obviously True Theorem No One Can Prove

Veritasium

Education4 min read43 min video

Jun 20, 2025|8,406,420 views|172,234|10,803

veritasium science physics Veritasium math Math Problem Mathematical Problem Famous Math Problem Goldbach's conjecture twin primes sum prime

Save to Pod

Key Moments

TL;DR

Goldbach's conjecture: Every even number > 2 is sum of two primes. Unsolved but Weak Goldbach proven.

Key Insights

The Goldbach Conjecture proposes that every even integer greater than 2 can be expressed as the sum of two prime numbers.

While the strong conjecture remains unproven, the weak Goldbach conjecture (every odd integer greater than 5 is the sum of three primes) has been proven.

Mathematicians use methods like the circle method and sieve methods to analyze the problem, often relying on advanced number theory and hypothetical constructs like the Riemann Hypothesis.

Chen Jingrun made significant progress on the strong conjecture, proving that every sufficiently large even number is the sum of a prime and a semiprime (a number that is a product of at most two primes).

Despite extensive computational checks up to very large numbers, no counterexample to the strong Goldbach conjecture has been found, suggesting it is likely true.

The pursuit of Goldbach's Conjecture highlights the importance of passion and perseverance in mathematics, even when direct applications are not immediately apparent.

THE STATEMENT AND ITS APPEAL OF SIMPLICITY

Goldbach's Conjecture, one of number theory's oldest unsolved problems, posits that every even integer greater than two can be written as the sum of two prime numbers. Its statement is easily understood, even by children, yet it has eluded the greatest mathematical minds for nearly 300 years. The allure of the problem is amplified by its simplicity, making it an accessible challenge that has captured the imagination of mathematicians and sparked intense dedication, such as that of Chen Jingrun, who was inspired to pursue it from a young age.

HISTORICAL ORIGINS AND FORMULATION

The conjecture traces its origins to correspondence between Christian Goldbach and Leonhard Euler in the 1740s. Goldbach initially proposed that every integer greater than 2 could be written as the sum of three primes. Euler, intrigued, refined this, suggesting that even numbers might be representable as the sum of just two primes. This evolved into two distinct statements: the weak Goldbach conjecture (odd numbers as the sum of three primes) and the strong Goldbach conjecture (even numbers as the sum of two primes). Euler himself famously declared the conjecture to be a "completely certain theorem" despite lacking a proof.

PROGRESS ON THE WEAK GOLDBACH CONJECTURE

While the strong conjecture remained elusive, significant progress was made on the weak Goldbach conjecture. In the early 20th century, G. H. Hardy and John Littlewood developed the powerful 'circle method,' which involves complex analysis and modular forms. They showed that, assuming the Generalized Riemann Hypothesis, the weak conjecture held for sufficiently large odd numbers. Later, Ivan Vinogradov proved the weak conjecture unconditionally for sufficiently large odd numbers, a monumental achievement. This laid the groundwork for Harald Helfgott, who in 2013 provided a complete proof for all odd numbers greater than five, utilizing computational verification and refined mathematical techniques.

ATTEMPTS TO PROVE THE STRONG CONJECTURE

The strong Goldbach conjecture has proven far more resistant. Hardy and Littlewood's work with the circle method provided an estimate for the number of ways an even number can be expressed as the sum of two primes, suggesting the conjecture's truth.Chen Jingrun's seminal work in the 1960s, employing sieve methods, established that every sufficiently large even number is the sum of a prime and a semiprime (a number that is prime or the product of two primes). This "1+2" result was the closest anyone had come to proving the strong conjecture, demonstrating incredible mathematical rigor and depth, likened to climbing the Himalayas.

THE ROLE OF COMPUTATION AND MODERN EFFORTS

Decades of intense effort have involved extensive computational verification. Mathematicians have used increasingly powerful computers to check Goldbach's conjecture for vast ranges of numbers. Currently, it has been verified for all even numbers up to an astounding four quintillion. This empirical evidence strongly suggests the conjecture is true, yet it does not constitute a formal proof. These computational efforts, while impressive, are on a minuscule scale compared to the infinite set of all even numbers, highlighting the need for a fundamental theoretical breakthrough.

THE UNYIELDING NATURE OF THE STRONG CONJECTURE

Despite the progress on the weak conjecture and the overwhelming computational evidence for the strong one, a formal proof for the latter remains elusive. The techniques that worked for the weak conjecture, like the circle method, do not directly translate, as the 'major arcs' and 'minor arcs' contributions shift in significance. The possibility remains that the conjecture could be false, and a counterexample—a single even number not expressible as the sum of two primes—might exist, albeit at an unimaginably large scale. The ongoing pursuit underscores the enduring power of simple questions in mathematics and the value of passionate dedication.

Mentioned in This Episode

●Products

●Organizations

●Studies Cited

●Concepts

●People Referenced

Common Questions

The Goldbach conjecture states that every even integer greater than 2 can be expressed as the sum of two prime numbers. This is one of the oldest and most famous unsolved problems in mathematics.

Topics

Goldbach Conjecture Number Theory Chen Jindrun Euler Hardy-Littlewood Ramanujan Weak Goldbach Conjecture Strong Goldbach Conjecture Circle Method Vinogradov Method Helfgott Proof

Mentioned in this video

conceptprimes

Numbers greater than 1 that have only two divisors: 1 and themselves.

conceptgeneralized Riemann hypothesis

A proposed extension of the Riemann hypothesis, the truth of which was assumed by Hardy and Littlewood in their approach to the weak Goldbach conjecture.

conceptsemiprime

A number that is the product of exactly two prime numbers.

personNils Pipping

Mathematician who manually checked all numbers up to 100,000 for counterexamples to Goldbach's conjecture in 1938.

personNicolaus Bernoulli

A mathematician whom Christian Goldbach met in London.

conceptweak Goldbach conjecture

The conjecture that every odd number greater than 5 can be written as the sum of three primes.

personJohn Littlewood

English mathematician who, with G. H. Hardy, worked on estimating the number of ways an even number can be written as the sum of two primes and collaborated with Ramanujan.

personSrinivasa Ramanujan

A self-taught Indian mathematician whose extraordinary intuition led him to profound mathematical discoveries, including those shared with G. H. Hardy.

personDavid Platt

Collaborated with Harald Helfgott on computationally checking numbers up to 8.8 x 10^30 for the weak Goldbach conjecture.

conceptsieve methods

A type of mathematical approach used by Chen Jingrun to prove that every sufficiently large even number is the sum of a prime and a semiprime.

organizationRed Guard

Militant student revolutionaries who were instrumental in carrying out the Cultural Revolution, targeting intellectuals and institutions.

personXu Chi

Famous journalist who wrote an article about Chen Jingrun's achievements and hardships, leading to him being celebrated as a national hero.

personGottfried Leibniz

Co-inventor of calculus, whom Christian Goldbach met during his travels.

personG. H. Hardy

English mathematician who, with John Littlewood, worked on estimating the number of ways an even number can be written as the sum of two primes and collaborated with Ramanujan.

conceptGoldbach's conjecture

The conjecture that every even integer greater than 2 can be expressed as the sum of two primes.

personChristian Goldbach

A Prussian mathematician from the early 1700s, known for formulating the conjecture that bears his name through correspondence with Euler.

conceptstrong Goldbach conjecture

The conjecture that every even number greater than 2 can be written as the sum of two primes.

personHarald Helfgott

Peruvian mathematician who successfully proved the weak Goldbach conjecture in 2013, specifying the bound below which it holds.

conceptGoldbach's comet

A visual representation showing the number of ways an even number can be expressed as the sum of two primes, which increases with the size of the number and resembles a comet's shape.

conceptcircle method

A mathematical technique developed by Hardy and Littlewood, and later used by Vinogradov and Helfgott, to tackle problems in number theory like the Goldbach conjecture.

conceptCultural Revolution

A socio-political movement in China from 1966 to 1976, initiated by Mao Zedong, which led to widespread persecution and loss of life, heavily impacting intellectuals like Chen.

productHenson Razor

A razor marketed as providing a superior shaving experience through precise engineering inspired by aerospace technology, mentioned as a sponsor product.

personLuo Shengxiong

Head of the mathematical institute who encouraged Chen Jingrun to publish his findings despite the risks during the Cultural Revolution.

personChen Jingrun

A 21-year-old Chinese mathematician who was deeply dedicated to solving the Goldbach conjecture, even while under threat during the Cultural Revolution.

studyprime number theorem

A theorem stating that the density of prime numbers around a number N is approximately 1/ln(N).

personIvan Vinogradov

Russian mathematician who proved the weak Goldbach conjecture without relying on the generalized Riemann hypothesis.