English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We prove that every odd number $N$ greater than 1 can be expressed as the sumof at most five primes, improving the result of Ramar\'e that every evennatural number can be expressed as the sum of at most six primes. We follow thecircle method of Hardy-Littlewood and Vinogradov, together with Vaughan'sidentity; our additional techniques, which may be of interest for otherGoldbach-type problems, include the use of smoothed exponential sums andoptimisation of the Vaughan identity parameters to save or reduce somelogarithmic losses, the use of multiple scales following some ideas ofBourgain, and the use of Montgomery's uncertainty principle and the large sieveto improve the $L^2$ estimates on major arcs. Our argument relies on someprevious numerical work, namely the verification of Richstein of the evenGoldbach conjecture up to $4 \times 10^{14}$, and the verification of van deLune and (independently) of Wedeniwski of the Riemann hypothesis up to height$3.29 \times 10^9$.

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