Erdős Problem #3 — Arithmetic progressions in sets with divergent reciprocal sum
I conjectured long ago that if
then the 's contain arbitrarily long arithmetic progressions. If true this of course implies that there are arbitrarily long arithmetic progressions all whose terms are primes. I offer 3000 dollars for a proof or disproof of (6).
Equivalent formulations 1Other wordings
Other statements of this same problem, merged from separate entries. Each is equivalent to the statement above — proving any one settles them all.
Erdős's divergent-reciprocal-sum conjecture on arithmetic progressions
Let satisfy
Erdős's conjecture. Then contains arbitrarily long arithmetic progressions. This generalizes the corresponding conjecture for the primes; the source does not state a resolution, so the problem remains open.
source: Weiwen Zhang, “Roth-type theorems in additive combinatroics”, arXiv:2512.08455 (2025).
References
Primary source
P. Erdős, A survey of problems in combinatorial number theory, Ann. Discrete Math. 6 (1980), 89-115.
Additional references
P. Erdős, A survey of problems in combinatorial number theory, Ann. Discrete Math. 6 (1980), 89-115.
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.