Numerical Verification of the Ternary Goldbach Conjecture up to 8.875e30

2013/05/14 by H. A. Helfgott, Helfgott, H. A., David J. Platt +1 · 2 citations
Mathematics · #Analytic Number Theory Research #FOS: Mathematics #Finite Group Theory Research #Limits and Structures in Graph Theory #Number Theory (math.NT) #Primary 11P32 Secondary 11A41 11Y11

paper · pdf · doi:10.48550/arxiv.1305.3062

openalex publication_date 2013/05/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We describe a computation that confirms the ternary Goldbach Conjecture up to 8,875,694,145,621,773,516,800,000,000,000 (>8.875e30).

Cited by

• Goldbach for Gaussian, Hurwitz, Octavian and Eisenstein primes
• The ternary Goldbach conjecture is true

Related

• The ternary Goldbach conjecture is true
• The ternary Goldbach problem
• Minor arcs for Goldbach's problem
• The ternary Goldbach problem
• Almost all primes are not needed in Ternary Goldbach