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 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 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 4imes1014, and the verification of van de Lune and (independently) of Wedeniwski of the Riemann hypothesis up to height 3.29imes109.



Cites work



Describes a project that uses

Uses Software





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)