Erdős Problem #144
Editorial depth: Reviewed explanatory article — evidence qualified.
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.
The question in plain language
Do almost all positive integers have two different divisors near one another? Erdős #144 asks whether the set of integers \(n\) that possess divisors \(d_1,d_2\mid n\) satisfying
has natural density one. “Density one” means the proportion of such integers among \(1,\ldots,N\) tends to one, not that the property holds for every integer. The inequalities are strict; equality \(d_2=2d_1\) does not qualify.
A small example
The divisors of \(12\) include \(2\) and \(3\), which satisfy \(2<3<4\). Thus 12 qualifies. A prime \(p\) has only divisors 1 and \(p\), so it does not qualify for any \(p\ge2\). These infinite exceptions are compatible with density one because the primes themselves have density zero.
What is known
PROVED. Helmut Maier and Gérald Tenenbaum (1984) established the stronger statement that for any fixed constant \(c>1\), almost all integers have two divisors obeying \(d_1<d_2<c d_1\). The maintained Erdős #144 also records a refined shrinking-gap threshold involving \((\log n)^{-\beta}\): the density-one result holds in the relevant regime \(\beta<\log3-1\), while Erdős–Hall established density zero above that threshold. The theorem for fixed \(c\) must not be mistaken for a bound with \(c\to1\) arbitrarily quickly as \(n\) grows.
GCL's current state
The catalogue and original issue #1413 classify the principal question PROVED. Primary citation: Maier–Tenenbaum, 1984, as identified on the maintained page. The complete original analytic-number-theory proof and its local divisor-distribution estimates have not been independently reproduced here. No frozen formal statement exists for this problem in the admitted 85f86371 snapshot.
The original source assignment has an authenticated RESULT/1 report. This is unadjudicated source evidence, not a proof certificate or accepted article.
What remains
Enumerate divisors for \(1\le n\le10^4\) with exact integers and test the existence of strict \(d_1<d_2<2d_1\). Acceptance: 12 passes and every prime fails; both exhaustive pair testing and sorted-neighbour testing agree. A finite frequency table cannot prove natural density one. A later formal task may compare fixed-ratio and shrinking-ratio quantifiers.
Sources and claim boundaries
- Maintained Erdős #144, Maier–Tenenbaum (1984), Erdős–Hall and historical attribution.
- Original GCL issue #1413.
No new divisor-distribution theorem, full primary-proof replay or editorial admission is claimed.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #1413 — 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.