MathLabs
TheoremProved

Ternary Goldbach theorem (Helfgott)

Statement

Every odd integer n>5n>5 is the sum of three primes: n=p1+p2+p3n=p_1+p_2+p_3.

Why is it true?

This 'weak' or ternary form of Goldbach's conjecture is far more tractable than the still-open binary form (every even number >2>2 is a sum of two primes): with three summands there is enough room for circle-method estimates to control the count of representations for every sufficiently large odd nn, and finite computation covers the remaining small cases.

Proof sketch

Use the Hardy–Littlewood circle method: split the estimate for the number of ways to write nn as p1+p2+p3p_1+p_2+p_3 into a 'major arc' contribution (near rationals with small denominator, governed by an explicit singular series) and a 'minor arc' contribution (which must be shown small). Helfgott's advance (2013, expanded 2015) combined sharper minor-arc bounds with precise major-arc estimates and large-scale numerical verification to cover every odd nn above an explicit threshold, with smaller cases checked directly by computer. Because of the scale and intricacy of the argument, the complete manuscript underwent an unusually long, multi-round refereeing process before being accepted as a research monograph in the Annals of Mathematics Studies series.

Proved by

Topics that use this theorem

Related theorems

Step-by-step proofs

References

  1. Harald A. Helfgott (2013). The ternary Goldbach conjecture is true · arXiv:1312.7748 [preprint, not peer-reviewed]
  2. Harald A. Helfgott (2015). The ternary Goldbach problem · arXiv:1501.05438 [preprint, not peer-reviewed]