pith. sign in

arxiv: 1610.02017 · v2 · pith:ZGCA3J4Onew · submitted 2016-10-06 · 🧮 math.NT

Vinogradov's theorem with almost equal summands

classification 🧮 math.NT
keywords thetaalmostequaleveryintegerlargeprimesprove
0
0 comments X
read the original abstract

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

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.