Skip to content

Erdős Problem #233

Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: open (not automatically the live result).
Subject areas: number theory, primes.

Read this status correctly

The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.

The question in plain language

Let \(p_1<p_2<\cdots\) be the primes and set \(d_n=p_{n+1}-p_n\). Erdős asked for the second-moment estimate

\[ \sum_{n=1}^N d_n^2\ll N(\log N)^2. \]

The implied constant must be independent of \(N\). The bound concerns the first \(N\) consecutive prime gaps, not all differences between primes in an interval.

A small example

The primes \(2,3,5,7,11\) have first four gaps \(1,2,2,4\), whose squared sum is \(1+4+4+16=25\). The prime-number theorem says the average gap near the prime with index \(N\) is about \(\log N\), but an average by itself does not control the average of squared gaps. A small number of unusually large gaps can dominate the latter.

Cauchy–Schwarz gives

\[ \sum_{n=1}^N d_n^2\ge \frac{(p_{N+1}-2)^2}{N}, \]

which by the prime-number theorem yields the matching-order lower bound \(N(\log N)^2\). This does not prove the required upper bound.

What is known

OPEN. Cramér (1936), assuming the Riemann hypothesis, obtained the weaker bound \(O(N(\log N)^4)\). Selberg (1943), still conditional on RH, obtained a weighted estimate involving \(\sum_{n\le N}d_n^2/n\). The conjectured scale would imply the pointwise bound

\[ d_N\ll N^{1/2}\log N \]

for every \(N\), by positivity of the summands. Such implications are a useful consistency test, but do not reverse.

The maintained Erdős #233 records the conjecture, historical conditional results and OEIS A074741. Its sharp upper bound is not currently established.

GCL's current state

The pinned and maintained status is OPEN. Original issue: #1502. No new prime-gap theorem or independent RH-conditional analytic proof is claimed.

The original issue contains an authenticated RESULT/1 source report. This is unadjudicated source evidence only, not independent mathematical certification or editorial admission.

What remains

A bounded task sieves primes through a selected cutoff, accumulates exact squared gaps and verifies both the telescoping and Cauchy–Schwarz inequalities. Acceptance: reproduce 25 for the first four gaps; report \(N\), the last prime, the squared sum and the ratio to \(N(\log N)^2\). A finite trend cannot settle the asymptotic bound.

Sources and claim boundaries

No new analytic upper bound, unconditional use of RH or protected editorial admission is claimed.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #1502 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: PROTECTED_READY_BACKLOG.
  • Formal-statement coverage: A provider statement was included in the pinned snapshot. Presence does not mean the statement or proof has been checked.
  • External mathematical status: consult current problem page and its dated bibliography.

Back to catalogue · Compendium introduction