The primes contain arbitrarily long arithmetic progressions
| dc.creator | Green, Ben | |
| dc.creator | Tao, Terence | |
| dc.date | 2004-04-08 | |
| dc.date | 2007-09-23 | |
| dc.date.accessioned | 2026-07-07T08:31:14Z | |
| dc.date.available | 2026-07-07T08:31:14Z | |
| dc.description | 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 sufficiently pseudorandom set of positive relative density contains progressions of arbitrary length. The third ingredient is a recent result of Goldston and Yildirim. Using this, one may place the primes inside a pseudorandom set of ``almost primes'' with positive relative density. | |
| dc.description | 56 pages. Further minor corrections | |
| dc.identifier | https://arxiv.org/abs/math/0404188 | |
| dc.identifier | http://arxiv.org/abs/math/0404188 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/138445 | |
| dc.subject | Number Theory | |
| dc.subject | Dynamical Systems | |
| dc.title | The primes contain arbitrarily long arithmetic progressions | |
| dc.type | text |