Erdős Problem #219 — Arbitrarily Long Arithmetic Progressions of Primes
Let denote the positive primes. An arithmetic progression of length with positive common difference is a set of the form
The question is whether, for every integer , there exist such that for every . Equivalently, for every positive integer , is there a finite arithmetic progression with ? Erdős Problems #219 Green and Tao (2008), The primes contain arbitrarily long arithmetic progressions
Background
The existence of arbitrarily long prime progressions was described as a classical, even folkloric, conjecture. A heuristic from the prime number theorem suggests that the number of -term prime progressions up to should have order ; Hardy and Littlewood’s 1923 prime-tuples conjecture predicts a more precise asymptotic. The first major advance was van der Corput’s 1939 proof that there are infinitely many three-term progressions of primes. Green and Tao’s proof for every length combines Szemerédi’s theorem with a transference principle: a set of positive relative density inside a sufficiently pseudorandom measure inherits long progressions. For primes, the -trick removes congruence obstructions from small prime moduli, and a pseudorandom majorant built using sieve estimates supplies the setting for that transfer. Green and Tao (2008), The primes contain arbitrarily long arithmetic progressions
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.