Erdős Problem #1099
Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: proved (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.
UNACCEPTED DRAFT — mathematical editorial review pending
This material is a provisional, source-qualified manuscript published for line-by-line scrutiny and real HTML/LaTeX testing. It has NOT received separate GCL editorial acceptance or independent mathematical certification. Its presence on this website is not evidence of a solution, reviewed coverage, or final publication.
Review the underlying draft on GitHub.
The question in plain language
Arrange all positive divisors of an integer \(N\) in increasing order:
Each quotient \(d_{i+1}/d_i\) measures how far apart two consecutive divisors are, on a multiplicative scale. For a fixed \(\alpha>1\), Erdős Problem #1099 asks whether there are infinitely large \(N\) along which
stays bounded. This is a bounded liminf, not boundedness for every integer.
A small example
For \(N=12\) the divisors are
The successive quotients are \(2,3/2,4/3,3/2,2\). Setting \(\alpha=2\) gives, using exact rational arithmetic,
The first quotient is at least two for every \(N>1\), so \(h_\alpha(N)\ge1\). The problem is whether the entire sum can stay uniformly small along an infinite sequence of numbers.
What is known
The maintained catalogue credits Vose (1984) with a positive answer by constructing a suitable sequence of integers.
Erdős had suggested factorials \(N=j!\) and least-common-multiples \(N=\mathrm{lcm}(1,\ldots,j)\) as natural candidates. According to the catalogue, whether those particular two sequences satisfy the bound is still open.
Erdős also studied the related quantity formed by summing the raw consecutive-divisor ratios and subtracting \(\tau(N)+\log N\). It is important not to conflate this secondary question with the proved existence of some bounded‑\(h_\alpha\) sequence.
GCL's current state
Authenticated source audit #2370 reproduces the exact divisor list and the calculation \(47/18\).
The source credits Vose's theorem but the proof and explicit sequence have not undergone independent primary-paper review. A current formalization is reported, without a matching file in the protected older snapshot.
What remains
Read Vose's construction and verify its dependence on \(\alpha\), the sequence of integers selected, and the distinction between a bounded liminf and all‑\(N\) bounds. Treat factorial and least-common-multiple cases as separate open problems.
Sources and claim boundaries
Erdős Problem #1099, original Erdős 1981 p.171 and Vose 1984 attribution; authenticated source return #2370. Finite rational calculation independently verified; general existence externally proved, special sequences open. Unaccepted draft.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2370 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
- 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.