The primes contain arbitrarily long arithmetic progressions

@article{Green2004ThePC,
  title={The primes contain arbitrarily long arithmetic progressions},
  author={B. Green and T. Tao},
  journal={Annals of Mathematics},
  year={2004},
  volume={167},
  pages={481-547}
}
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… Expand
753 Citations
Patterns of Primes in Arithmetic Progressions
  • 8
  • PDF
Strings of special primes in arithmetic progressions
  • 2
  • Highly Influenced
  • PDF
Almost Arithmetic Progressions in the Primes and Other Large Sets
  • J. Fraser
  • Mathematics, Computer Science
  • Am. Math. Mon.
  • 2019
  • 2
  • PDF
Szemerédi's theorem in the primes
  • 2
  • PDF
Structure and arithmetic in sets
  • Highly Influenced
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 66 REFERENCES
Roth's theorem in the primes
  • 145
  • PDF
SIX PRIMES AND AN ALMOST PRIME IN FOUR LINEAR EQUATIONS
  • 3
  • Highly Influential
  • PDF
A new proof of Szemerédi's theorem
  • 737
  • PDF
Number Theory and Algebraic Geometry: Linear relations amongst sums of two squares
  • 25
  • PDF
A Quantitative Ergodic Theory Proof of Szemerédi's Theorem
  • T. Tao
  • Mathematics, Computer Science
  • Electron. J. Comb.
  • 2006
  • 98
  • PDF
...
1
2
3
4
5
...