ErdosProblems · research open · AMS 11

unsolvedsorry — nobody on it

Erdős Problem 233

Conjecture 233 · Erdős

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.

Formal statement · Lean 4.lean
theorem erdos_233 :
    (fun N => ((∑ n ∈ Finset.range N, (primeGap n) ^ 2) : ℝ)) =O[atTop] fun N => N * (log N)^2 := by
  sorry

Proof. sorry

Nobody has tried yet.

Reference ↗ · Lean source ↗