The primes contain arbitrarily long arithmetic progressions

Green, Ben

doi:10.4007/annals.2008.167.481

The primes contain arbitrarily long arithmetic progressions

2008-03-01

388

OA

AI

DOI：10.4007/annals.2008.167.481

原文链接

原文求助

摘要

En 中文

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 (or measure) of positive relative density contains progressions of arbitrary length. The third ingredient is a recent result of Goldston and Yildirim, which we reproduce here. Using this, one may place (a large fraction of) the primes inside a pseudorandom set of almost primes (or more precisely, a pseudorandom measure concentrated on almost primes) with positive relative density.

Keyword:

SZEMEREDI THEOREM

LINEAR-EQUATIONS

ERGODIC AVERAGES

PROOF

CONVERGENCE

REGULARITY

DENSITY

NUMBER

SETS

The primes contain arbitrarily long arithmetic progressions

摘要

期刊

机构

引用论文