- Green–Tao theorem
In
mathematics , the Green–Tao theorem, proved by Ben Green andTerence Tao in 2004, [Ben Green and Terence Tao, [http://arxiv.org/abs/math.NT/0404188 The primes contain arbitrarily long arithmetic progressions] ,8 Apr 2004.] states that the sequence ofprime number s contains arbitrarily longarithmetic progression s. In other words, for any natural number "k", there exist "k"-termarithmetic progression s of primes. The proof is an extension ofSzemerédi's theorem .In 2006, Tao and Tamar Ziegler extended the result to cover polynomial progressions. [Terence Tao, Tamar Ziegler, [http://arXiv.org/abs/math.NT/0610050 The primes contain arbitrarily long polynomial progressions] ] More precisely, given any integer-valued polynomials "P"1,..., "P""k" in one unknown "m" with vanishing constant terms, there are infinitely many integers "x", "m" such that "x" + "P"1("m"), ..., "x" + "P""k"("m") are simultaneously prime. The special case when the polynomials are "m", 2"m", ..., "km" implies the previous result that there are length "k" arithmetic progressions of primes.
These results were
existence theorem s and did not show how to find the progressions. On January 18, 2007, Jaroslaw Wroblewski found the first known case of 24primes in arithmetic progression : [Jens Kruse Andersen, [http://hjem.get2net.dk/jka/math/aprecords.htm Primes in Arithmetic Progression Records] . Retrieved on2008-09-08 ] :468395662504823 + 205619 × 23# × "n", for "n" = 0 to 23 (23# = 223092870).On May 17, 2008, Wroblewski and Raanan Chermoni found the first known case of 25 primes::6171054912832631 + 366384 × 23# × "n", for "n" = 0 to 24.ee also
*
Szemerédi's theorem
*Erdős conjecture on arithmetic progressions
*Dirichlet's theorem on arithmetic progressions
*Arithmetic combinatorics References
External links
* [http://mathworld.wolfram.com/news/2004-04-12/primeprogressions MathWorld news article on proof]
Wikimedia Foundation. 2010.