Erdős Problem #692
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: disproved (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
Let δ_1(n,m) be the natural density of integers having exactly one positive divisor in the open interval (n,m). For a fixed n, Erdős asked whether the values as m increases beyond n+1 rise to a maximum and then fall (unimodality), and where any maximum occurs. The maintained status is DISPROVED (externally LEAN-reported): the uniform unimodality claim is false, even for n=3. This does not mean all detailed maximizing indices are classified.
A small example
For n=3, only divisors 4 and 5 count when m=6. In one period L=lcm(4,5)=20, seven integers have exactly one of the divisors: δ_1(3,6)=7/20. Adding divisor 6 gives δ_1(3,7)=1/3. Adding divisor 7 gives δ_1(3,8)=38/105. These exact rational values obey 7/20 > 1/3 < 38/105, a strict dip followed by a rise, so unimodality already fails at n=3. All calculations are finite CRT densities, not numerical sampling approximations.
What is known
Stijn Cambie's primary published 'Resolution of Erdős' problems about unimodularity', Journal of Number Theory 280 (2026), 271–277, DOI 10.1016/j.jnt.2025.08.014, supplies a negative resolution and proves far stronger existence of superpolynomially many local extrema for relevant fixed parameters. The maintained source also records Erdős's old bound δ_1(n,m)≪1/(log n)^c, with later Ford improvements. A 2026 comment reports an external Aristotle/Lean formalization, but no #692 file exists in GCL's admitted formal-conjectures snapshot, and no external Lean theorem/axiom audit was performed. Published disproof is not a GCL formal proof certificate.
GCL's current state
The authenticated original RESULT/1 source return retains its original BOUNDED_TASK_DESIGNED disposition and mathematical qualifications. This source-grounded explanation is editorially reviewed through the exact-hash EC-BULK-005-R8 protected transaction, effective on protected merge. It is not a fresh proof of the attributed mathematical theorem or an internally replayed Lean certificate.
Critical source-scope distinction: Cambie explicit local dip for n3, divisor interval OPEN endpoints, external Lean unvalidated.
What remains
Produce a source-locked finite rational proof of the n=3 dip using the 420-residue CRT period and reproduce the correct prime/divisor endpoints. For the stronger superpolynomial-extrema theorem, verify Cambie's exact statement and hypotheses in its original Section 2 and compare to any externally reported Lean proof target. Do not claim that the maximizing m for every n is determined.
Sources and claim boundaries
Maintained problem #692; https://www.erdosproblems.com/692 ; https://doi.org/10.1016/j.jnt.2025.08.014 ; https://arxiv.org/abs/2501.10333 ; GCL original source issue #1963. Historical [Er79e] full passage not independently inspected. GCL original issue return. Historical source pages and full theorem proofs not uniformly inspected. The original full theorem proof and external formal certification remain distinct.
Editorial provenance: protected R8 source-critical review. Original issue-level source and research-proof holds remain. Status: REVIEWED explanatory article; full historical theorem proofs, unresolved conjectures and external Lean proofs are not newly certified.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #1963 — 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.