Skip to content

Erdős Problem #693

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

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

Fix an integer k≥2. Let A be the increasing sequence of integers in [n,n^k] having at least one divisor STRICTLY between n and 2n. Erdős asks how large the largest gap between consecutive elements of A can become as n→∞ with k fixed. Is the maximal gap bounded by some fixed power of log n (constants may depend on k)? The maintained catalogue remains OPEN, with original [Er79e] uninspected.

A small example

For n=10,k=2, the first qualifying values are 11,12,…,19 and then 22,24,26,28,... . Exact enumeration of all a∈[10,100] gives 51 qualifying integers and maximum internal consecutive gap 4. For n=12,k=2, the maximum is 6. The interval endpoints and the strict divisor inequality matter: 20 does not qualify when n=10 merely because 20 divides itself or 10 divides 20.

What is known

Every integer d in (n,2n) qualifies itself, so A contains n+1,n+2,…,2n−1. Beyond that initial block, A is the union of positive multiples of each d∈{n+1,…,2n−1}, truncated to [n,n^k]. Simple periodicity gives an eventual repetition of a finite modulus lcm(n+1,…,2n−1), but this modulus is vastly larger than any power of log n, so it does not prove the desired bound. For a finite n,k, the membership test is existential divisibility by a number in (n,2n); neither the density of the union nor a positive proportion of covered integers rules out long sparse gaps. The maintained page cross-references #446 without claiming an established polylogarithmic upper bound.

GCL's current state

The original authenticated RESULT/1 source return records BOUNDED_TASK_DESIGNED and retains the original mathematical qualifications. This is an editorially reviewed explanatory article in the EC-BULK-005-R9 protected batch, effective only when that exact-hash transaction merges. The corresponding maintained Erdős statement and its bibliography were inspected. This editorial decision does not certify any full original theorem proof, independent external formalization, or Lean kernel check.

Preserved source-review qualifications: polylog rich divisor gaps open; finite numerical fixtures only. See the immutable 128-case critical review record for the complete source-return caveats.

What remains

For k=2 or 3, derive and verify a rigorous interval-covering lemma for the union of multiples of d∈(n,2n), using explicit sieve or divisor-density bounds. State the exact maximum over gaps fully internal to the ordered A and distinguish gaps near n^k. Acceptance: an exact proof with n-uniform polylogarithmic estimate or a named obstruction; bounded enumeration for n=10,12,20 is only a falsification fixture. Obtain the historical Erdős [Er79e] wording before strengthening claims.

Sources and claim boundaries

Maintained Erdős Problem #693; original issue source return; historical [Er79e] not independently inspected. No theorem novelty, mathematical certification, protected merge, browser rendering verification or V2 admission.

Editorial source decision: R9 critical review, REVIEWED as a source-grounded explanation only. All open mathematical questions, primary-proof fidelity obligations, and external formalization caveats remain separate.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #1964 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: STATEMENT_CAPTURE_REQUIRED.
  • Formal-statement coverage: No statement was confirmed in GCL's pinned formal-provider 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