The ternary Goldbach conjecture is true

Abstract

The ternary Goldbach conjecture, or three-primes problem, asserts that every odd integer $n$ greater than $5$ is the sum of three primes. The present paper proves this conjecture. Both the ternary Goldbach conjecture and the binary, or strong, Goldbach conjecture had their origin in an exchange of letters between Euler and Goldbach in 1742. We will follow an approach based on the circle method, the large sieve and exponential sums. Some ideas coming from Hardy, Littlewood and Vinogradov are reinterpreted from a modern perspective. While all work here has to be explicit, the focus is on qualitative gains. The improved estimates on exponential sums are proven in the author's papers on major and minor arcs for Goldbach's problem. One of the highlights of the present paper is an optimized large sieve for primes. Its ideas get reapplied to the circle method to give an improved estimate for the minor-arc integral.

79 pages, 1 figure. Minimal changes

Cited by in corpus (14)

• Will a physicist prove the Riemann Hypothesis?
• Computing Spectra -- On the Solvability Complexity Index Hierarchy and Towers of Algorithms
• A computational history of prime numbers and Riemann zeros
• Vinogradov's Theorem with Fouvry-Iwaniec Primes
• Distribution of Square Prime Numbers
• The ternary Goldbach problem with primes in positive density sets
• Optimal Presentations of Mathematical Objects
• Is Goldbach Conjecture true?
• Problems on combinatorial properties of primes
• A "Vertical" Generalization of the binary Goldbach's Conjecture as applied on primes with prime indexes of any order i (i-primes)
• Additive Representations of Natural Numbers
• Errata and Addenda to Mathematical Constants
• Exceptional autonomous components of Goldbach factorization graphs
• Representation of an integer as the sum of a prime in arithmetic progression and a square-free integer