Erdős Problem #1061
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
The sum-of-divisors function \(\sigma(n)\) adds all positive divisors of \(n\). Ordinarily there is no simple relationship between \(\sigma(a)+\sigma(b)\) and \(\sigma(a+b)\). Yet sometimes they are equal:
Erdős Problem #1061 asks how often this happens for positive integers \(a,b\) with \(a+b\le x\), and whether the number of solutions behaves like \(cx\) for some constant \(c>0\) as \(x\) grows.
There is a counting convention to fix first: ordered pairs count \((a,b)\) and \((b,a)\) separately. The frozen Lean formulation uses ordered pairs. Ignoring that distinction would change the proposed leading constant.
A small example
For \(a=4\) and \(b=5\), we obtain
For \(a=2\), \(b=6\), the equality is \(3+12=15=\sigma(8)\). Thus \((4,5)\) and \((2,6)\) are genuine solutions, as are their reversals.
Independent integer enumeration gives exactly 8 ordered solutions with \(a+b\le10\), 12 with \(a+b\le20\), and 26 with \(a+b\le40\). These are finite facts; the ratios to \(x\) do not determine an asymptotic constant.
What is known
The canonical catalogue records the question as open and attributes it to Guy, Unsolved Problems in Number Theory, problem B15. An external 2026 claim of resolution has been mentioned in the discussion, but its manuscript, proof, and relationship to the exact pair-counting convention have not been independently checked by GCL.
A plausible heuristic is not a theorem. Even a convincing number of finite experiments would not prove existence of the limiting positive constant \(c\).
GCL's current state
Source audit #2332 verifies the exact ordered-pair convention of the frozen formal statement, whose asymptotic theorem is unproved. Two integer divisor-sum methods agree in the bounded examples. The audit does not claim a source-locked original Erdős publication or a completed external proof review.
What remains
One needs a rigorous asymptotic count or a disproof of the proposed linear law, with ordered and unordered conventions stated explicitly. A bounded GCL successor can extend the finite enumeration with two independent divisor-sum implementations, then investigate the external 2026 manuscript for primary evidence, an exact leading constant, and its mathematical assumptions.
Sources and claim boundaries
- Erdős Problem #1061, question and maintained status.
- Problem discussion, reports of a claimed later result, not independent verification.
- Richard K. Guy, Unsolved Problems in Number Theory (2004), B15; original print verification outstanding.
- Frozen formal definition.
- Authenticated source audit #2332 and finite checks; source-bounded research, not proof certification or editorial admission.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2332 — 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.