Erdős Problem #845
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: disproved (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.
The question in plain language
A set of 2,3-smooth integers has prime factors only two and three. Even requiring all summands to lie within a fixed multiplicative interval leaves enough flexibility to represent every positive integer, contradicting the old density-zero conjecture.
Given fixed C>0, consider integers representable as sum n=b1+...+bt of DISTINCT strictly increasing 2,3-smooth positive integers bi=2^a3^b (nonnegative exponents) with bt <= C b1. Erdős proposed these integers have natural density zero for every fixed C. DISPROVED already at C=6: EVERY positive integer has such a representation with bt<6 b1 by van Doorn and Everts. Do not confuse this bounded-ratio sum result with the older pairwise-nondividing smooth summand conjecture.
A small example
For n=1,2,3,4,5,6 each is 2,3-smooth itself (single-term ratio 1), except 5 is not smooth and 5=2+3 has ratio 3/2. n=7=3+4 gives ratio 4/3. These small checks do not prove the all-integers theorem.
A finite instance tests the definition, not a claim quantified over every large graph, infinite set or arbitrary coloring.
What is known
Maintained https://www.erdosproblems.com/latex/845 read 2026-10-14: van Doorn–Everts [vDEv25], Smooth sums with small spacings, arXiv:2511.04585 (2025), prove all positive integers can be written with max/min<6. Erdős–Lewin [ErLe96] give optimal universal C>2, van Doorn–Everts C>=3 and comment-based conjecture perhaps ~3.604. The exact least C remains a DIFFERENT OPEN optimization. Original full preprint proof unreviewed.
The allowed generators are positive numbers of the form 2^u 3^v with nonnegative exponents. For a representation by distinct increasing generators, the spread is maximum divided by minimum; it equals one for a singleton. The reported van Doorn–Everts theorem gives strict spread less than six for every positive integer, so the density is actually ONE at C=6. Finding the sharp universal spread remains a separate optimization.
GCL's current state
The authenticated original RESULT/1 source return records SOURCE_LOCK_READY and preserves its issue-bound mathematical source observations. This explanatory article is REVIEWED under the exact-hash EC-BULK-005-R6 editorial transaction, subject to the protected merge of PR #2676. Its original source-audit status is retained. Editorial acceptance and public MathJax validation do not certify any original research theorem, external Lean file, or complete historical proof.
Unclosed mathematical proof/source qualifications: VAN_DOORN_EVERTS2025_FULL_CONSTRUCTION_NOT_REPLAYED; OPTIMAL_SPREAD_CONSTANT_STILL_OPEN.
What remains
Implement bounded brute-force witness search for n<=100 using 2,3-smooth terms, check increasing distinct and strict ratio<6, record a small witness for 5 and 7. Source-lock 2025 constructive proof and distinguish universal C upper from optimal C.
For mathematical proof certification, the complete primary argument and any external formalization must undergo separate independent replay. The bounded finite calculation is recorded in the governed R6 fixture; editorial approval does not discharge the outstanding research obligations.
Sources and claim boundaries
- Erdős problem #845 and maintained LaTeX/bibliography, read 14 October 2026.
- Authenticated source-audit return, including original historical bibliography and source proof limitations.
- Pinned teorth/erdosproblems revision 536408716724a2402bdfa7c1d764bf83d64a8c89, data/problems.yaml. External proofs not independently GCL certified.
- Editorial decision: exact-hash reviewed explanatory article, protected R6 transaction. Mathematical theorem proof / external Lean certification: NOT CLAIMED. The original SOURCE_LOCK_READY return, primary-source attribution, and proof-review holds remain.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2116 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
- 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.