Home
Search Site
Largest
Finding
How Many?
Mersenne
Glossary
Prime Curios!
e-mail list
FAQ
Prime Lists
Titans
Submit primes
|
This is the Prime Pages'
interface to our BibTeX database. Rather than being an exhaustive database,
it just lists the references we cite on these pages. Please let me know of any errors you notice.References: [ Home | Author index | Key index | Search ]
- Tao2014
- Tao, Terence, "Every odd number greater than 1 is the sum of at most five primes," Math. Comp., 83:286 (2014) 997--1038. (https://doi.org/10.1090/S0025-5718-2013-02733-0) MR 3143702
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Ă© 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 L2 estimates on major arcs. Our argument relies on some previous numerical work, namely the verification of Richstein of the even Goldbach conjecture up to 4 × 1014, and the verification of van de Lune and (independently) of Wedeniwski of the Riemann hypothesis up to height 3.29 × 109.
|