The primes contain arbitrarily long arithmetic progressions
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 ingre...
Main Authors: | , |
---|---|
Format: | Journal article |
Published: |
2004
|