Skip to content

Erdős Problem #208

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

List the positive squarefree integers in increasing order \(s_1<s_2<\cdots\). A squarefree integer has no repeated prime factor, so no prime square divides it. Erdős asked how large the gap \(s_{n+1}-s_n\) can be.

Two related questions remain: whether for every \(\varepsilon>0\) and sufficiently large \(s_n\),

\[ s_{n+1}-s_n\ll_\varepsilon s_n^\varepsilon, \]

and whether the much sharper near-logarithmic estimate holds:

\[ s_{n+1}-s_n \le(1+o(1))\frac{\pi^2}{6}\frac{\log s_n}{\log\log s_n}. \]

The second expression is not interchangeable with the first. The constant \(\pi^2/6\) is a proposed sharp upper scale.

A small example

The first positive squarefree numbers are \(1,2,3,5,6,7,10,11,13,14,15,\ldots\). The numbers \(8=2^3\) and \(9=3^2\) are not squarefree, so the gap between \(7\) and \(10\) equals three. A squarefree-gap certificate must check every integer between consecutive squarefree numbers, not merely find a large number divisible by a prime square.

If \(p^2\mid m\), then \(m\) fails the squarefree predicate. Trial division by all prime squares up to \(m\) is sufficient for finite fixtures, but it gives no asymptotic gap bound.

What is known

Both unconditional questions are OPEN. Erdős (1951) constructed infinitely many gaps of size at least

\[ (1+o(1))\frac{\pi^2}{6}\frac{\log s_n}{\log\log s_n}, \]

showing why the conjectured near-logarithmic upper coefficient would be optimal.

Filaseta and Trifonov (1992) proved gaps of size at most \(s_n^{1/5+o(1)}\). Pandey (2024) improved the exponent to \(1/5-c\) for some absolute \(c>0\), but this is still far from every positive power \(\varepsilon\). Granville (1998) showed that the ABC conjecture implies the weaker bound \(s_{n+1}-s_n\ll_\varepsilon s_n^\varepsilon\); the ABC conditional implication is not an unconditional proof.

The maintained Erdős #208, edited October 2025, preserves both open questions and these partial estimates. The average density \(6/\pi^2\) of squarefree numbers does not alone control maximal gaps; a positive average density can coexist with long empty intervals.

GCL's current state

Pinned and live status: OPEN. Original issue #1477. A source statement file exists in the frozen provider, but the squarefree index convention, asymptotic quantifiers and conditional-versus-unconditional proof boundaries need semantic verification. No kernel 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 enumerates squarefree integers up to \(N=100000\), computes every gap and records its endpoints and all excluded intervening integers with square divisors. Acceptance: the initial gap from \(7\) to \(10\) is three, exact sieve results match a second trial-division implementation, and no finite graph of gap ratios is presented as an asymptotic theorem. A proof-level task should identify the precise Filaseta–Trifonov and Pandey exponent hypotheses.

Sources and claim boundaries

No new squarefree-gap bound, proof of the ABC conjecture or editorial admission is claimed.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #1477 — 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