Erdős Problem #145
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: open (not automatically the live result).
Subject areas: number theory.
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
A positive integer is squarefree if no prime square divides it. List the squarefree integers in increasing order as \(s_1<s_2<\cdots\), and denote consecutive gaps by \(g_j=s_{j+1}-s_j\). Erdős #145 asks whether, for every fixed real exponent \(\alpha\ge0\), the limit
exists. The normalization is by the real cutoff \(x\), not by the number of gaps. The sum uses gaps with their left endpoint \(s_j\le x\), so the final right endpoint may exceed \(x\).
A small example
The initial squarefree integers are \(1,2,3,5,6,7,10,11,13,14,15\). Their early gaps are \(1,1,2,1,1,3,1,2,1,1\). For \(\alpha=0\), every gap contributes one, and the limit equals the natural density of squarefree integers, \(6/\pi^2\). For \(\alpha=1\), the sum telescopes:
where \(s_J\) is the last squarefree number at most \(x\). The terminal gap must be handled to recover a limiting value one.
What is known
The unrestricted assertion is OPEN. Erdős proved existence for \(0\le\alpha\le2\). Hooley extended it to \(\alpha\le3\), and Greaves–Harman–Huxley to \(\alpha\le11/3\). Tsz Ho Chan, On moments of gaps between consecutive square-free numbers, Moscow Journal of Combinatorics and Number Theory (2023), 287–295, reaches \(\alpha\le3.75\) (i.e. \(15/4\)).
Granville, ABC allows us to count squarefrees, International Mathematics Research Notices (1998), 991–1009, obtains the conditional all-moments conclusion from the ABC conjecture. A conditional consequence is not a proof of unconditional convergence. The indexed gaps are highly dependent, so a numerical histogram is not a substitute for uniform control of large gaps.
GCL's current state
The pinned and maintained Erdős #145 classify it OPEN. Original source issue: #1414. The upper proved exponent, chronology and ABC dependency were checked against the maintained bibliographic source; the full 2023 or 1998 proof was not independently reproduced.
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 successor generates all squarefree integers up to \(10^5\) by an exact prime-square sieve, computes the left-endpoint-normalized sums for exponents \(0,1,2,3\), and independently verifies the \(\alpha=1\) telescoping identity at every tested cutoff. Acceptance: do not omit the final gap crossing \(x\); report the finite-cutoff values without interpreting convergence numerically as proof for \(\alpha>15/4\).
Sources and claim boundaries
- Maintained Erdős #145, original [Er51], [Ho73], [GHH97], [Ch23c] and [Gr98].
- Granville, IMRN (1998), conditional ABC implication.
- GCL source issue #1414.
No unconditional all-moments theorem, independent proof certification or editorial admission is claimed.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #1414 — 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.