Every odd number greater than 1 is the sum of at most five primes
From MaRDI portal
Publication:2871196
Abstract: We prove that every odd number 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 estimates on major arcs. Our argument relies on some previous numerical work, namely the verification of Richstein of the even Goldbach conjecture up to , and the verification of van de Lune and (independently) of Wedeniwski of the Riemann hypothesis up to height .
Recommendations
Cites work
- scientific article; zbMATH DE number 3158043 (Why is no real title available?)
- scientific article; zbMATH DE number 4137889 (Why is no real title available?)
- scientific article; zbMATH DE number 3582249 (Why is no real title available?)
- scientific article; zbMATH DE number 1346247 (Why is no real title available?)
- scientific article; zbMATH DE number 2121181 (Why is no real title available?)
- scientific article; zbMATH DE number 871718 (Why is no real title available?)
- scientific article; zbMATH DE number 903693 (Why is no real title available?)
- A Note on the Large Sieve
- A complete Vinogradov 3-primes theorem under the Riemann hypothesis
- Additive properties of dense subsets of sifted sequences
- Approximate formulas for some functions of prime numbers
- Computing \(\pi(x)\) analytically
- Distribution of zeros of Dirichlet \(L\)-functions and an explicit formula for \(\psi(t,\chi)\)
- Eigenvalues in the large sieve inequality
- Estimates of $\theta(x;k,l)$ for large values of $x$
- Explicit Bounds for Some Functions of Prime Numbers
- Explicit Estimates for the Error Term in the Prime Number Theorem for Arithmetic Progressions
- Explicit upper bounds for exponential sums over primes
- Exponential sums over primes and the prime twin problem
- Montgomery's weighted sieve for dimension two
- On Bombieri's asymptotic sieve
- On primes in arithmetic progressions
- On the Vinogradov bound in the three primes Goldbach conjecture
- On the Zeros of the Riemann Zeta Function in the Critical Strip. IV
- On triples in arithmetic progression
- On Šnirelman's constant under the Riemann hypothesis
- Primes in arithmetic progressions
- Restriction theory of the Selberg sieve, with applications
- Short effective intervals containing primes
- Short effective intervals containing primes in arithmetic progressions and the seven cubes problem
- The analytic principle of the large sieve
- The large sieve
- The large sieve
- Topics in multiplicative number theory
- Verifying the Goldbach conjecture up to \(4\cdot 10^{14}\)
- Zero-Free Regions for Dirichlet L-Functions, and the Least Prime in an Arithmetic Progression
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
- scientific article; zbMATH DE number 4077358 (Why is no real title available?)
- 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
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)