Every odd number greater than 1 is the sum of at most five primes

DOI10.1090/S0025-5718-2013-02733-0zbMATH Open1318.11126arXiv1201.6656WikidataQ56137579 ScholiaQ56137579MaRDI QIDQ2871196FDOQ2871196

Authors: Terence Tao 

Publication date: 22 January 2014

Published in: Mathematics of Computation (Search for Journal in Brave)

Abstract: We prove that every odd number $N$ greater than 1 can be expressed as the sum of at most five primes, improving the result of Ramar'e that every even natural number can be expressed as the sum of at most six primes. We follow the circle method of Hardy-Littlewood and Vinogradov, together with Vaughan's identity; our additional techniques, which may be of interest for other Goldbach-type problems, include the use of smoothed exponential sums and optimisation of the Vaughan identity parameters to save or reduce some logarithmic losses, the use of multiple scales following some ideas of Bourgain, and the use of Montgomery's uncertainty principle and the large sieve to improve the $L^2$ estimates on major arcs. Our argument relies on some previous numerical work, namely the verification of Richstein of the even Goldbach conjecture up to $4imes10^{14}$, and the verification of van de Lune and (independently) of Wedeniwski of the Riemann hypothesis up to height $3.29imes10^9$.

Full work available at URL: https://arxiv.org/abs/1201.6656

Recommendations

• scientific article; zbMATH DE number 1150253
• The ternary Goldbach problem
• On odd Goldbach problem under general Riemann hypothesis
• scientific article; zbMATH DE number 4137889
• scientific article; zbMATH DE number 979921

zbMATH Keywords

Goldbach's problemexplicit bounds for exponential sums

Mathematics Subject Classification ID

Estimates on exponential sums (11L07) Sums over primes (11L20) Goldbach-type theorems; other additive questions involving primes (11P32) Applications of the Hardy-Littlewood method (11P55) Applications of sieve methods (11N36)

Cites Work

• Topics in multiplicative number theory
• The analytic principle of the large sieve
• Title not available (Why is that?)
• Short effective intervals containing primes
• On triples in arithmetic progression
• The large sieve
• Estimates of $\theta(x;k,l)$ for large values of $x$
• Primes in arithmetic progressions
• Computing \(\pi(x)\) analytically
• Restriction theory of the Selberg sieve, with applications
• Approximate formulas for some functions of prime numbers
• Title not available (Why is that?)
• Eigenvalues in the large sieve inequality
• Zero-Free Regions for Dirichlet L-Functions, and the Least Prime in an Arithmetic Progression
• Title not available (Why is that?)
• Verifying the Goldbach conjecture up to \(4\cdot 10^{14}\)
• A complete Vinogradov 3-primes theorem under the Riemann hypothesis
• On the Vinogradov bound in the three primes Goldbach conjecture
• On Šnirelman's constant under the Riemann hypothesis
• Title not available (Why is that?)
• Additive properties of dense subsets of sifted sequences
• A Note on the Large Sieve
• The large sieve
• On the Zeros of the Riemann Zeta Function in the Critical Strip. IV
• Explicit Estimates for the Error Term in the Prime Number Theorem for Arithmetic Progressions
• Explicit Bounds for Some Functions of Prime Numbers
• On Bombieri's asymptotic sieve
• Title not available (Why is that?)
• On primes in arithmetic progressions
• Title not available (Why is that?)
• Explicit upper bounds for exponential sums over primes
• Exponential sums over primes and the prime twin problem
• Montgomery's weighted sieve for dimension two
• Title not available (Why is that?)
• Short effective intervals containing primes in arithmetic progressions and the seven cubes problem
• Distribution of zeros of Dirichlet \(L\)-functions and an explicit formula for \(\psi(t,\chi)\)

Cited In (17)

• On multiplicative functions which are additive on sums of primes
• Computers as a novel mathematical reality. IV: The Goldbach problem
• Empirical verification of the even Goldbach conjecture and computation of prime gaps up to 4⋅10¹⁸
• The ternary Goldbach problem
• The Riemann hypothesis is true up to 3·1012
• An explicit density estimate for Dirichlet \(L\)-series
• The weak Goldbach conjecture
• Title not available (Why is that?)
• Upper triangular matrices over information algebras
• Oriented bipartite graphs and the Goldbach graph
• New bounds for $\psi (x)$
• Decidability and classification of the theory of integers with primes
• A consequence of the ternary Goldbach theorem
• Zeta functions and asymptotic additive bases with some unusual sets of primes
• Estimates of \(\psi\), \(\theta\) for large values of \(x\) without the Riemann hypothesis
• PRIME NUMBERS: AN ALTERNATIVE STUDY USING OVA-ANGULAR ROTATIONS
• The major arcs in the ternary Goldbach problem

Uses Software

• ZetaGrid

This page was built for publication: Every odd number greater than 1 is the sum of at most five primes

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