Erdős Problem #1062
Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
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.
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
Select some numbers from \(\{1,\ldots,n\}\). A selection is fork-free if no member divides two different other members of that same selection. For example, \(\{2,4,6\}\) is forbidden because \(2\) divides both \(4\) and \(6\).
Let \(f(n)\) be the largest possible size of a fork-free selection. Erdős Problem #1062 asks for its asymptotic size and whether the limiting ratio \(f(n)/n\) is irrational. An approximate numerical range alone does not settle a question about irrationality.
A small example
The interval
is always fork-free. Every \(a\in A\) exceeds \(n/3\), so \(3a>n\). Thus, among elements of \(A\), at most the single distinct multiple \(2a\) can follow \(a\). It follows immediately that
For \(n=15\), the set \(\{6,7,\ldots,15\}\) has ten members and satisfies the rule. Exhaustive inspection of all \(2^{15}\) subsets of \(\{1,\ldots,15\}\) confirms \(f(15)=10\).
What is known
Kenneth Lebensold's paper A Divisibility Problem (first published June 1977), pp. 291–294, established stronger asymptotic bounds. The maintained catalogue gives, for sufficiently large \(n\),
This narrow interval lies above the elementary \(2n/3\) lower construction, but does not determine whether any limiting ratio is irrational. An April 2026 discussion proposes effective computability of the limit via divisor-graph methods; this newer research claim requires independent source and proof review before changing GCL's status record.
GCL's current state
Authenticated source audit #2333 checks the exact three-distinct-elements condition and compares it to the frozen Lean definition. The pinned file proves the elementary interval lower bound, but its Lebensold and irrationality claims include unproved placeholders.
Independent exhaustive search gives the values of \(f(n)\) for \(n=1,\ldots,15\) as
This is finite verification only, not mathematical certification of a global extremal theorem.
What remains
The original mathematical question seeks an exact asymptotic density and its arithmetic nature. GCL's next bounded task is to inspect Lebensold's paper page by page, examine the recent proposed effective-computability theorem, and test its exact assumptions against the fork-free graph formulation. Finite extremal searches can test examples but cannot decide irrationality.
Sources and claim boundaries
- Erdős Problem #1062, original question and reported bounds.
- Kenneth Lebensold (1977), A Divisibility Problem, Studies in Applied Mathematics 56(3), pp. 291–294, DOI 10.1002/sapm1977563291; publisher metadata and abstract verified, full proof pages not yet audited.
- Discussion of #1062, subsequent reported progress.
- Frozen formal-conjectures source.
- Authenticated audit #2333 and finite enumeration; no general proof certification or protected editorial admission.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2333 — 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.