Skip to content

Erdős Problem #1060

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

For a positive integer \(k\), let \(\sigma(k)\) be the sum of its positive divisors. Define

\[ f(n)=\#\{k\ge1:k\,\sigma(k)=n\}. \]

Erdős Problem #1060 asks whether this number of representations can grow only very slowly:

\[ f(n)\le n^{o(1/\log\log n)}. \]

A stronger question is whether \(f(n)\) is bounded above by some fixed power of \(\log n\) for all sufficiently large \(n\). These are statements about arbitrarily large \(n\), not about a finite list of computations.

A small example

The value \(n=336\) has two representations:

\[ 12\,\sigma(12)=12\cdot28=336, \qquad 14\,\sigma(14)=14\cdot24=336. \]

To prove that there are no others, note that \(\sigma(k)\ge k\), so \(k\,\sigma(k)\ge k^2\). Hence any solution must satisfy \(k\le\lfloor\sqrt{336}\rfloor=18\). Direct divisor-sum enumeration for all \(1\le k\le18\) establishes \(f(336)=2\).

We extended this exact finite test to all \(n\le65{,}536\). Two divisor-sum algorithms agreed for every \(1\le k\le256\). The largest multiplicity observed was \(2\), reached at \(336\), \(5952\), \(10080\), \(27776\), \(44352\), \(60480\) and \(61152\). This is a rigorous, reproducible finite-range result, not an asymptotic theorem.

What is known

The canonical Erdős catalogue records the problem as open, referring to Richard Guy's Unsolved Problems in Number Theory, problem B11. The full original Erdős source is not identified in the checked packet, and the precise edition and page of Guy's discussion still require source-level review.

The frozen formal-conjectures transcription represents \(f(n)\) by counting \(k\le n\) satisfying \(k\,\sigma(k)=n\); the restriction is harmless because \(k\le\sqrt n\). Its two proposed upper bounds are recorded as open statements, not completed proofs.

GCL's current state

The authenticated issue-bound source audit identifies the exact statement and the formal source while expressly reporting a missing historical primary-source lock. Its calculation \(f(336)=2\) and the finite bound through \(65{,}536\) were independently reproduced.

No source-complete audit, new proof of either asymptotic bound, or certified formal replay is claimed. The article is an unaccepted draft pending primary-source fidelity review.

What remains

The mathematical problem is to prove one of the proposed upper bounds, or find integers violating it. A useful bounded successor is to verify the complete collision list to larger cutoffs using independent exact algorithms, beginning with the least \(n>65{,}536\) such that \(f(n)\ge3\), if one exists. Historical source work must locate the precise original Erdős question and verify Guy's formulation. Finite observations alone cannot establish the conjectured growth rate.

Sources and claim boundaries

  • Erdős Problem #1060, maintained problem statement and status.
  • Richard K. Guy, Unsolved Problems in Number Theory (2004), problem B11; original source lineage requires verification.
  • Frozen Lean statement, without a proof of either bound.
  • Authenticated GCL source return #2331, partial source research and checked finite computation, not mathematical certification or protected editorial admission.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #2331 — 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.

Back to catalogue · Compendium introduction