Terence Tao
Published 2005-05-19Version 1
In this expository article, we describe the recent approach, motivated by ergodic theory, towards detecting arithmetic patterns in the primes, and in particular establishing that the primes contain arbitrarily long arithmetic progressions. One of the driving philosophies is to identify precisely what the obstructions could be that prevent the primes (or any other set) from behaving ``randomly'', and then either show that the obstructions do not actually occur, or else convert the obstructions into usable structural information on the primes.
Comments: 32 pages, no figures. Submitted, special edition of Quarterly J. Pure Appl. Math. in honour of John Coates
The primes contain arbitrarily long arithmetic progressions
On the Uniformity of $(3/2)^n$ Modulo 1
The dichotomy between structure and randomness, arithmetic progressions, and the primes
![QR code for arXiv:math/0505402 [math.NT]](http://oss.arxitics.com/images/favicon.svg)