The weak Goldbach conjecture

MaRDI QIDQ2878076zbMATH OpenFDO

Authors Harald A. Helfgott

Publication date 28 August 2014

Published in La Gaceta de la Real Sociedad Matemática Española (Search for Journal in Brave)

zbMATH Keywords

circle methodDirichlet \(L\) functionsminor arcternary Goldbach conjecture

Mathematics Subject Classification ID

Goldbach-type theorems; other additive questions involving primes (11P32) Applications of the Hardy-Littlewood method (11P55)

Review text

In this article the author explains his solution of the ternary (also called weak) Goldbach conjecture and the history behind this old problem. It appeared for the first time in the correspondence between Euler and Goldbach. In modern terms it states that any odd integer greater that 5 can be written as the sum of three prime numbers.NEWLINENEWLINEThe fist big step toward the conjecture was given by \textit{I. M. Vinogradov} [C. R. (Dokl.) Acad. Sci. URSS, n. Ser. 15, 169--172 (1937; Zbl 0016.29101)], proving the conjecture for all odd integers bigger than some unspecified constant \(C\). This was already proven by \textit{G. H. Hardy} and \textit{J. E. Littlewood} [Acta Math. 41, 119--196 (1917; JFM 46.0498.01)] but under the assumption of the Generalized Riemann Hypothesis. Since then the constant \(C\) has been specified and improved gradually. The lowest value known was \(C= e^{3100}\), see [\textit{M.-C. Liu} and \textit{T. Wang}, Acta Arith. 105, No. 2, 133--175 (2002; Zbl 1019.11026)]. The author reduced this constant to \(C= 10^{29}\) [``Major arcs for Goldbach's problem, Preprint, \url{arXiv:1305.2897}]. With this bound he achieved the proof of the ternary Goldbach conjecture. NEWLINENEWLINENEWLINE The main ingredients in the author's proof, like the circle method due to Hardy-Littlewood, Dirichlet \(L\)-functions and their poles, and major arcs estimations are also explained. The article is written in a very comprehensible language.

Recommendations

• Goldbach's problem -- on sums of three primes
• On Vinogradov's constant in Goldbach's ternary problem
• A consequence of the ternary Goldbach theorem
• The ternary Goldbach problem
• Every odd number greater than 1 is the sum of at most five primes

Cited in

(21)

• An additive problem over Piatetski-Shapiro primes and almost-primes
• Random gap processes and asymptotically complete sequences
• On a ternary Diophantine equation involving fractional powers with prime variables of a special form
• Upper triangular matrices over information algebras
• Exact formulae for the fractional partition functions
• On a Frankl-Wilson theorem
• On the partition of an odd number into three primes in a prescribed proportion
• On the representation of a large integer as the sum of a prime and a square-free number with at most three prime divisors
• Two independent checkings of the weak Goldbach conjecture up to \(10^{27}\)
• A consequence of the ternary Goldbach theorem
• Goldbach's problem -- on sums of three primes
• scientific article; zbMATH DE number 5722345 (Why is no real title available?)
• scientific article; zbMATH DE number 4077358 (Why is no real title available?)
• Hua’s theorem with the primes in Piatetski-Shapiro prime sets
• scientific article; zbMATH DE number 6423843 (Why is no real title available?)
• The ternary Goldbach problem
• AN -FUNCTION-FREE PROOF OF VINOGRADOV’S THREE PRIMES THEOREM
• scientific article; zbMATH DE number 5187495 (Why is no real title available?)
• Mathematics and the formal turn
• Computers as a novel mathematical reality. IV: The Goldbach problem
• On Chen's theorem over Piatetski-Shapiro type primes and almost-primes

This page was built for publication: The weak Goldbach conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2878076)