The primes contain arbitrarily long arithmetic progressions

By Ben Joseph Green, Terence Tao. 2004

975 citations recorded by the source corpus.

We prove that there are arbitrarily long arithmetic progressions of primes. There are three major ingredients. The first is Szemeredi�s theorem, which asserts that any subset of the integers of positive density contains progressions of arbitrary length. The second, which is the main new ingredient of this paper, is a certain transference principle. This allows us to deduce from Szemeredi�s theorem that any subset of a suficiently pseudorandom set (or measure) of positive relative density contains progressions of arbitrary length. The third ingredient is a recent result of Goldston and Yildirim, which we reproduce here. Using this, one may place (a large fraction of) the primes inside a pseudorandom set of �almost primes� (or more precisely, a pseudorandom measure concentrated on almost primes) with positive relative density.

Subfields: Algebra and Number Theory, Discrete Mathematics and Combinatorics

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Algebra and Number Theory

  1. Terence Tao
  2. Nikos Frantzikinakis
  3. William T. Gowers
  4. T. Ziegler
  5. Ben Joseph Green
  6. Bryna Kra
  7. David Conlon
  8. B. Host

In Discrete Mathematics and Combinatorics

  1. Terence Tao
  2. Nikos Frantzikinakis
  3. William T. Gowers
  4. Ben Joseph Green
  5. T. Ziegler
  6. B. Host
  7. David Conlon
  8. Bryna Kra

Citations in the corpus