Erdős Problem #200 — Longest prime arithmetic progressions
For an integer , let be the largest length of an arithmetic progression of primes contained in . Explicitly, the progression has first term a prime , positive integer common difference , and length , with every term at most :
The question is whether
where tends to infinity through the integers and denotes the natural logarithm. Erdős Problems #200
Background
The broader question of finding long arithmetic progressions among the primes has a long history. A Hardy–Littlewood conjecture from 1923 predicts an asymptotic count for prime progressions of any fixed length. In 1939, van der Corput proved that there are infinitely many three-term arithmetic progressions of primes. These fixed-length results concern existence at each prescribed length, whereas the present question asks how the maximum length available below a growing cutoff compares with . The primes contain arbitrarily long arithmetic progressions
The later proof that the primes contain arbitrarily long progressions uses a transference principle: it applies Szemerédi’s theorem to a pseudorandom majorant for the primes, obtained through a set of almost primes. This provides a route from dense-set structure to prime progressions, but its conclusion is existence for each fixed length, not a quantitative estimate for the longest length as a function of . The primes contain arbitrarily long arithmetic progressions
References
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
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.