Green–Tao theorem
From Wikipedia, the free encyclopedia
In mathematics, the Green–Tao theorem, proved by Ben Green and Terence Tao in 2004,[1] states that the sequence of prime numbers contains arbitrarily long arithmetic progressions. In other words, for any natural number k, there exist k-term arithmetic progressions of primes.
In 2006, Tao and Tamar Ziegler extended the result to cover polynomial progressions.[2] More precisely, given any integer-valued polynomials P1,..., Pk in one unknown m with vanishing constant terms, there are infinitely many integers x, m such that x + P1(m), ..., x + Pk(m) are simultaneously prime. The special case when the polynomials are m, 2m, ..., km implies the previous result that there are length k arithmetic progressions of primes.
Since they are existence theorems, they do not show how to find the progressions. On January 18, 2007, Jaroslaw Wroblewski found the first known case of 24 primes in arithmetic progression:[3]
[edit] See also
- Szemerédi's theorem
- Erdős conjecture on arithmetic progressions
- Dirichlet's theorem on arithmetic progressions
[edit] References
- ^ Ben Green and Terence Tao, The primes contain arbitrarily long arithmetic progressions,8 Apr 2004.
- ^ Terence Tao, Tamar Ziegler, The primes contain arbitrarily long polynomial progressions
- ^ Jens Kruse Andersen, Primes in Arithmetic Progression Records
