A New Proof of Vinogradov's Three Primes Theorem
Number Theory
2013-03-12 v1 Combinatorics
Abstract
We give a new proof of Vinogradov's three primes theorem, which asserts that all sufficiently large odd positive integers can be written as the sum of three primes. Existing proofs rely on the theory of L-functions, either explicitly or implicitly. Our proof uses instead a transference principle, the idea of which was first developed by Green. To make our argument work, we also develop an additive combinatorial result concerning popular sums, which may be of independent interest.
Keywords
Cite
@article{arxiv.1303.2276,
title = {A New Proof of Vinogradov's Three Primes Theorem},
author = {Xuancheng Shao},
journal= {arXiv preprint arXiv:1303.2276},
year = {2013}
}
Comments
21 pages