Erdős Problem #470
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: open (not automatically the live result).
Subject areas: number theory, divisors.
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 positive integer is semiperfect when some subset of its distinct proper divisors sums to the number itself. It is weird when its divisor sum exceeds twice the number but it is not semiperfect. A weird number is primitive if no proper divisor is weird. Erdős #470 asks two separate questions: does an odd weird integer exist, and are there infinitely many primitive weird numbers?
A small example
The divisors of 70 are 1, 2, 5, 7, 10, 14, 35, 70 and their sum is 144. Its proper divisors sum to 74, exceeding 70 by four. A subset of proper divisors summing to 70 would have a complementary subset summing to four, but the only proper divisors at most four are 1 and 2, summing to at most three. Hence 70 is weird, although even.
The odd number 945 is abundant, with divisor sum 1920 and surplus 30. Since 27 and 3 are proper divisors summing to 30, their complement in the proper-divisor list sums to 945. Thus 945 is semiperfect, not odd weird.
What is known
Benkoski and Erdős (1974) established foundational results on weird numbers. Fang's 2022 preprint states that no odd weird number lies below \(10^{21}\); it also excludes odd weird numbers below \(10^{28}\) only when the abundance surplus is less than \(10^{14}\). The second result is conditional, not an unconditional exclusion of the whole interval. GCL has not independently replayed the expensive computational searches.
An odd weird number of least size, if one exists, must be primitive abundant. This uses the elementary observation that multiples of semiperfect numbers remain semiperfect.
GCL's current state
Source audit #1740 reconciles both questions, reproduces the arithmetic examples, and checks source qualifiers. The work is not a formal proof of either global question.
What remains
Finite odd-number searches cannot exclude unbounded examples. A theorem about the abundance of weird numbers in general does not establish infinitely many primitive weird numbers. Both questions remain open in the reviewed dated record.
Sources and claim boundaries
- Erdős Problems #470: current external problem record.
- Benkoski–Erdős (1974), Mathematics of Computation 28, 617–623.
- Fang (2022), Theorems 1.1 and 1.2: finite computational bounds with different hypotheses.
- GCL source audit: source and arithmetic checks, not MathCert.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #1740 — 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.