HackerPapers

arXiv:1312.7748math.NT

The ternary Goldbach conjecture is true

H. A. Helfgott

HN submission. Found in a submission link or body. Submitters do not count as commenters in the main ranking; a submission is not an endorsement.

Abstract

The ternary Goldbach conjecture, or three-primes problem, asserts that every odd integer $n$ greater than $5$ is the sum of three primes. The present paper proves this conjecture. Both the ternary Goldbach conjecture and the binary, or strong, Goldbach conjecture had their origin in an exchange of letters between Euler and Goldbach in 1742. We will follow an approach based on the circle method, the large sieve and exponential sums. Some ideas coming from Hardy, Littlewood and Vinogradov are reinterpreted from a modern perspective. While all work here has to be explicit, the focus is on qualitative gains. The improved estimates on exponential sums are proven in the author's papers on major and minor arcs for Goldbach's problem. One of the highlights of the present paper is an optimized large sieve for primes. Its ideas get reapplied to the circle method to give an improved estimate for the minor-arc integral.

arXiv comments
79 pages, 1 figure. Minimal changes
Journal reference
DOI
Subjects
math.NTNumber Theory

On Hacker News

No comments linking this paper were found in the collected sources. Found in 1 HN submission from Jan 2014 to Jan 2014. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments0 threads

No comments linking this paper were found in the collected sources. Open submission discussions.

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.