Skip to content

Erdős problem 233

Start work

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

How the state got here

0 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingNothing recorded here
  6. Next gapNot recorded

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.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:5920dc05b172560254783a337b1c4d3e9e7448c7eb8000929f288a3e4c0e71ff
Metadata
sha256:f7029bb4fdde0370a01f80f85515727ace4a50b33493ecab7fb499f4c081b836
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:a04dbe8fdb2fd099594819cf36506b03c53f264388b9842bcb1e8f6288ce4aeb
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON