Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated

Problem 825

../

claims/: The 1 claim page of Problem 825, one per claimant's result; the problem's standing derives from them.


Statement. Is there an absolute constant C>0C>0 such that every integer nn with σ(n)>Cn\sigma(n)>Cn is the distinct sum of proper divisors of nn?

Status. The site labels the problem PROVED (LEAN) (page last edited 1 February 2026). Larsen's proof and its Lean formalization are recorded on the claim page Larsen 2026.

Source. erdosproblems.com/825, accessed 2026-09-04. Cite as: T. F. Bloom, Erdős Problem #825, https://www.erdosproblems.com/825.

References.

  • [Gu04] Guy, Richard K., Unsolved problems in number theory, third edition, Problem Books in Mathematics, Springer (2004), xviii+437 pp.; B2 "Almost perfect, quasi-perfect, pseudoperfect, harmonic, weird, multiperfect and hyperperfect numbers", printed p. 77: the weird-number questions, the last being "Can σ(n)/n\sigma(n)/n be arbitrarily large for weird nn?", which Benkoski and Erdős conjecture has answer no, and for which Erdős offered a prize; a weird nn is abundant and not a sum of distinct proper divisors, so this question's constant CC is the conjectured bound on σ(n)/n\sigma(n)/n. Library home: guy_2004_unsolved_problems_number_theory.

Formalization. Statement in formal-conjectures. Larsen's Lean proof is recorded on the claim page Larsen 2026.

Progress

Not yet compiled.

Known Results

Not yet compiled.

Linked library material

These entries are derived from explicit links on library pages. They are navigation only and do not by themselves record mathematical progress.