Compositio Mathematica · 2017 · 22 citations · 18 references
Natural SciencesMathematicsCombinatoricsNumber TheoryPhilosophy Of MathematicsAlgebraic Number TheoryCombinatorial Number TheoryAlmost Primes
In this paper we prove two results concerning Vinogradov’s three primes theorem with primes that can be called almost twin primes. First, for any $m$ , every sufficiently large odd integer $N$ can be written as a sum of three primes $p_{1},p_{2}$ and $p_{3}$ such that, for each $i\in \{1,2,3\}$ , the interval $[p_{i},p_{i}+H]$ contains at least $m$ primes, for some $H=H(m)$ . Second, every sufficiently large integer $N\equiv 3~(\text{mod}~6)$ can be written as a sum of three primes $p_{1},p_{2}$ and $p_{3}$ such that, for each $i\in \{1,2,3\}$ , $p_{i}+2$ has at most two prime factors.
18
Zhang Yitang · Annals of Mathematics · 2014 · 463 citations · Full text
Ben Green, Terence Tao · Annals of Mathematics · 2010 · 363 citations · Full text
James Maynard · Annals of Mathematics · 2014 · 306 citations · Full text