English

Improving Roth's theorem in the primes

Number Theory 2009-12-10 v1

Abstract

Let A be a subset of the primes. Let \delta_P(N) = \frac{|\{n\in A: n\leq N\}|}{|\{\text{nn prime}: n\leq N\}|}. We prove that, if \delta_P(N)\geq C \frac{\log \log \log N}{(\log \log N)^{1/3}} for N\geq N_0, where C and N_0 are absolute constants, then A\cap [1,N] contains a non-trivial three-term arithmetic progression. This improves on B. Green's result, which needs \delta_P(N) \geq C' \sqrt{\frac{\log \log \log \log \log N}{\log \log \log \log N}}.

Keywords

Cite

@article{arxiv.0912.1842,
  title  = {Improving Roth's theorem in the primes},
  author = {Harald Andres Helfgott and Anne de Roton},
  journal= {arXiv preprint arXiv:0912.1842},
  year   = {2009}
}

Comments

13 pages

R2 v1 2026-06-21T14:21:53.164Z