English

Vinogradov's theorem with almost equal summands

Number Theory 2017-05-04 v2

Abstract

Let θ>11/20\theta > 11/20. We prove that every sufficiently large odd integer nn can be written as a sum of three primes n=p1+p2+p3n = p_1 + p_2 + p_3 with pin/3nθ|p_i - n/3| \leq n^{\theta} for i{1,2,3}i\in\{1,2,3\}.

Keywords

Cite

@article{arxiv.1610.02017,
  title  = {Vinogradov's theorem with almost equal summands},
  author = {Kaisa Matomäki and James Maynard and Xuancheng Shao},
  journal= {arXiv preprint arXiv:1610.02017},
  year   = {2017}
}

Comments

27 pages

R2 v1 2026-06-22T16:13:32.781Z