CiteULike is a free online bibliography manager. Register and you can start organising your references online.

The primes contain arbitrarily long arithmetic progressions Export

(9 Feb 2006)

Citation Format

[Posts]

View FullText article


abie's tags for this article

major-breakthrough

X Reviews [Write a review of this article]

X Find related articles from these CiteULike users

X Find related articles with these CiteULike tags

X Posting History

X Abstract

We prove that there are arbitrarily long arithmetic progressions of primes. <br />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.


X BibTeX record

X RIS record


Privacy Statement | Terms & Conditions
CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.