Erdős problem 233 · problems.science

A conjecture by Heath-Brown: The sum of squares of the first $N$ gaps between consecutive primes behaves like $N * (log N)^2$ .

Result history

Published changes, performers, checks, and later corrections.

No result history yet

No proposed change is retained for this Problem, so there is nothing to show a decision on.

No correction history

Technical detailsExact roots, source, and retained record identifiers

Problem row: sha256:5920dc05b172560254783a337b1c4d3e9e7448c7eb8000929f288a3e4c0e71ff
Metadata: sha256:f7029bb4fdde0370a01f80f85515727ace4a50b33493ecab7fb499f4c081b836
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:a04dbe8fdb2fd099594819cf36506b03c53f264388b9842bcb1e8f6288ce4aeb

Repository: sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection: sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit: 2415f78e850aeee50afdca525c6f2e0ea606f207