Erdős Problem #1052
Editorial depth: Reviewed explanatory article — evidence qualified.
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.
The question in plain language
A divisor \(d\) of \(n\) is unitary when \(\gcd(d,n/d)=1\). An integer is unitary perfect if the sum of its proper unitary divisors equals \(n\). If \(\sigma^*(n)\) is the sum of all unitary divisors (including \(n\)), the condition is
Erdős #1052 asks whether only finitely many unitary perfect numbers exist. A list of five examples and extensive bounded searches cannot decide a global finiteness assertion.
A small example
The unitary divisors of 6 are \(1,2,3,6\): all satisfy the coprimality requirement. The proper ones sum to \(1+2+3=6\), so 6 is unitary perfect.
If \(n=\prod_i p_i^{e_i}\) with distinct primes \(p_i\), a unitary divisor must take either all or none of each prime-power component. Consequently,
It is essential that each factor really be a power of a single distinct prime. Arbitrarily grouping composite factors can create false numerical matches.
What is known
Subbarao and Warren (1966) documented the early unitary perfect numbers; Wall (1975) established the fifth, which does not prove that it is the last. The source record lists \(6,60,90,87360\) and \(146361946186458562560000\) as five historically known examples. Later Wall papers bound the structures of any further examples, including restrictions on odd prime-power components.
GCL's current state
The authenticated source audit reconciles the frozen statement, primary literature and bounded elementary checks. These observations are not a new GCL mathematical certification.
What remains
To prove finiteness, all sufficiently complicated canonical prime-power factorizations must be excluded by an unbounded argument. To prove infinitude, one needs an infinite valid family. Relaxed multiplicative identities without genuine prime-power conditions are not evidence of additional unitary perfect numbers.
Sources and claim boundaries
- Erdős Problems #1052: problem statement and five recorded examples.
- Subbarao–Warren (1966), Unitary Perfect Numbers, Canadian Mathematical Bulletin 9, 147–153.
- Wall (1975), The Fifth Unitary Perfect Number, Canadian Mathematical Bulletin 18, 115–122.
- GCL source audit #2323: prime-power exactness, finite computations and false-positive regression.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2323 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: FIRST_RECONNAISSANCE_TRANCHE.
- 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.