Skip to content

Erdős Problem #1053

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 \(n\), let \(\sigma(n)\) denote the sum of its positive divisors. A multiply-perfect number satisfies

\[ \sigma(n)=kn \]

for an integer multiplier \(k\ge1\). Ordinary perfect numbers have \(k=2\).

Erdős Problem #1053 asks whether, among all multiply-perfect integers tending to infinity, the multiplier must satisfy

\[ k=o(\log\log n). \]

In plain language, \(k\) must become negligible compared with the slowly growing quantity \(\log\log n\). A constant upper bound on \(k\) would be sufficient, but is not known in the required generality. Standard upper bounds of order \(\log\log n\) are not strong enough to settle the question.

A small example

The divisors of \(6\) sum to \(1+2+3+6=12=2\cdot6\); likewise, \(\sigma(28)=56=2\cdot28\). A different multiplier occurs for \(120=2^3\cdot3\cdot5\):

\[ \sigma(120)=(1+2+4+8)(1+3)(1+5) =15\cdot4\cdot6=360=3\cdot120. \]

We independently verified these divisor sums, cross-checked two divisor-sum implementations for all integers from 1 through 1,000, and enumerated multiply-perfect examples through 10,000. They show that \(k\) is not fixed at \(2\).

There is also a useful elementary restriction: the only squarefree multiply-perfect positive integers are \(1\) and \(6\). Indeed, for squarefree \(n>1\), write \(P\) for its largest prime factor. The Euler-product upper bound gives \(k=\sigma(n)/n<P\). As \(P\) divides \(\sigma(n)=\prod_{q\mid n}(q+1)\) but cannot divide \(k\), some smaller prime divisor \(q\) must satisfy \(P\mid q+1\). Necessarily \(q+1=P\), which is possible for primes only at \(q=2\), \(P=3\). Thus \(n=6\).

The inequality \(k<P\) follows by comparing \(\sigma(n)/n\) with the product of \(p/(p-1)\) over primes \(p\le P\): that product is at most \(P\). This classification is a restricted lemma, not a resolution of the open problem for integers with repeated prime factors.

What is known

The canonical Erdős Problems page lists the question as open and attributes it to Erdős through Richard Guy's Unsolved Problems in Number Theory, problem B2.

Erdős's 1956 paper On Perfect and Multiply Perfect Numbers established results about how sparse multiply-perfect numbers are. A bound on the number of eligible integers below \(x\) does not by itself give an improved bound on the multiplier of each one. The paper's exact comparison with Guy's statement remains subject to primary-source review.

GCL's current state

Authenticated source audit #2324 records the exact question, independently checks the three finite divisor sums, and provides the elementary squarefree classification. The audit identifies the missing full page-level check of Guy (2004) and Erdős (1956). No compatible frozen formal statement is admitted in GCL's referenced provider snapshot.

These results support a source-bounded explanation, not a mathematical resolution or formal proof certification.

What remains

An actual resolution must control multipliers uniformly along arbitrary large multiply-perfect integers, including those with repeated prime factors. The near-term research target is a reproducible divisor-sum enumeration and a primary-source comparison of the 1956 counting theorem, with its quantifiers kept distinct from the desired pointwise bound. Neither computation nor the squarefree lemma can prove the general asymptotic statement.

Sources and claim boundaries

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #2324 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: STATEMENT_CAPTURE_REQUIRED.
  • 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.

Back to catalogue · Compendium introduction