The primes contain arbitrarily long arithmetic progressions

Details The primes contain arbitrarily long arithmetic progressions The primes contain arbitrarily long arithmetic progressions

2004-04-08

arxiv.org/abs/math/0404188v6

Mathematics

Number Theory

56 pages. Further minor corrections

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The primes contain arbitrarily long arithmetic progressions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The primes contain arbitrarily long arithmetic progressions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The primes contain arbitrarily long arithmetic progressions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-158715