PROVED
This has been solved in the affirmative.
Are there arbitrarily long arithmetic progressions of primes?
The answer is yes, proved by Green and Tao
[GrTa08]. The stronger claim that there are arbitrarily long arithmetic progressions of consecutive primes is still open.
See also
[3] and
[141].
This is discussed in problem A5 of Guy's collection
[Gu04].
View the LaTeX source
This page was last edited 28 September 2025.
When referring to this problem, please use the original sources of Erdős. If you wish to acknowledge this website, the recommended citation format is:
T. F. Bloom, Erdős Problem #219, https://www.erdosproblems.com/219, accessed 2026-01-16