← All problems

Erdős Problem #219 — Arbitrarily Long Arithmetic Progressions of Primes

1 year old · traced to

Let P\mathbb P denote the positive primes. An arithmetic progression of length kk with positive common difference is a set of the form

{a+jd:0≤j<k},a,d∈Z>0.\{a+jd:0\le j<k\},\qquad a,d\in\mathbb Z_{>0}.

The question is whether, for every integer k≥1k\ge 1, there exist a,d∈Z>0a,d\in\mathbb Z_{>0} such that a+jd∈Pa+jd\in\mathbb P for every j=0,1,…,k−1j=0,1,\ldots,k-1. Equivalently, for every positive integer NN, is there a finite arithmetic progression s⊆Ps\subseteq\mathbb P with ∣s∣≥N|s|\ge N? 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 kk-term prime progressions up to XX should have order X2/(log⁡X)kX^2/(\log X)^k; 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 WW-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

References

Progress summary

Never refreshed

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.