Skip to content

Erdős problem 233

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.

Workspace

Continue locallyOpen sourceSign in to contribute

Open this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.

Canvas

public preview
  1. Source#233
  2. ResultNone
  3. Checks0

Reported activity

Work these sources record against this Problem. Source-reported attribution, not reviewed here.

Search problems.science

Find a Problem, Result, source, or page