Skip to content

Erdős Problem #825

Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: proved (not automatically the live result).
Subject areas: number theory, divisors, unit fractions.

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

Does there exist ABSOLUTE C>0 such that every n with sigma(n)>Cn is a sum of DISTINCT proper positive divisors? This is stronger than abundance sigma(n)>2n: such exceptional abundant nonsemiperfect numbers are weird. No requirement to use all divisors.

A small example

n=70 has sigma(70)=144>2*70 but its proper positive divisors {1,2,5,7,10,14,35} have no subset sum 70. In contrast n=12 has proper divisors {1,2,3,4,6}, and 12=6+4+2 using distinct proper divisors. Explicit finite subset-sum algorithms can confirm both. Necessary universal C must exceed 2, not merely be positive.

The example can be checked exactly. A finite witness does not replace the universal, asymptotic, or infinitely-often quantifiers in the original question.

What is known

Maintained https://www.erdosproblems.com/825 updated 2026-02-01 labels PROVED by Daniel Larsen, source proof https://github.com/Larsen-Daniel/Erdos-825/blob/main/825.pdf. It states for each epsilon>0 there is L so any n with least prime factor >L and sigma(n)>(2+epsilon)n is semiperfect. This least-prime-factor theorem is not logically identical by itself to an unconditional absolute C; the missing reduction to handle small prime factors needs checking in Larsen's actual proof, not assumption. Conjectural sharp C=3 is not declared proved. The PDF full proof has not been independently reviewed or formalized by GCL.

Finite obstruction to \(C=2\). The proper positive divisors of 70 are

$$

{1,2,5,7,10,14,35},\qquad \sigma(70)=144>140.

$$

No subset sums to 70. Thus any universally valid \(C\) must satisfy \(C>2\). Larsen's reported theorem with a restriction on the least prime factor is a separate, stronger-looking assertion with a restricted input class: obtaining the original unconditional absolute \(C\) requires a proof of the associated reduction. Its existence is reported by the catalogue; a particular numerical \(C\), such as 3, is not established in this audit.

GCL's current state

The original authenticated RESULT/1 source return has historical disposition STATUS_CONFLICT. This status and the original research exceptions are preserved, not silently converted into a theorem verdict. The maintained Erdős source and source-specific mathematical definitions were reviewed, and this article is editorially reviewed as a source-exception-annotated explanation under EC-BULK-005-R10, effective only after the exact-hash protected admission merges.

Source interpretation and unresolved mathematical qualification: Larsen's reported semiperfectness theorem assumes a lower bound on least prime factor; a reduction to an absolute universal C is not yet source-verified.

The explanation is accepted for publication of established background, examples, and explicitly attributed current claims. It does not establish or formally certify the disputed original theorem, external model-assisted proof, historical interpretation, or any unreplayed Lean kernel file. Original source-fidelity and proof-review research holds remain.

What remains

Fetch Larsen primary PDF and prove the absolute-C deduction, quantify any explicit C, independently review fine print for prime factor restrictions, and verify 70/12 exact subset sums. Until then catalogue PROVED is source-reported; source-fidelity hold prevents protected mathematical certification.

Independent critical review must compare the historical primary theorem to the written quantifiers, inspect the exact finite fixture, determine whether a claimed status refers to the whole question or a subcase, and validate the actual rendered mathematical output. No protected admission or formal theorem certification is claimed.

Sources and claim boundaries

  • Maintained Erdős problem #825 and its LaTeX/bibliography, read 14 October 2026.
  • Authenticated original GitHub source-return record. All original historical bibliography, quantified status limitations and exact source observations are recorded in that return.
  • Pinned teorth/erdosproblems revision 536408716724a2402bdfa7c1d764bf83d64a8c89, data/problems.yaml. no newly certified theorem proof source-lock alteration is claimed.
  • Source theorem proof: PARTIAL and identified where unread. Independent mathematical acceptance: PENDING. Protected merge: NONE. Deployed MathJax: NOT VERIFIED. External Lean certification by GCL: NONE.

Qualified editorial critical review: R10 source-exception dossier. The source-semantic exception is visible and its original research hold remains. Publication classification: REVIEWED EXPLANATORY ARTICLE WITH UNRESOLVED SOURCE/PROOF QUALIFICATIONS. Independent theorem proof or Lean certification: NOT CLAIMED.

Catalogue and evidence provenance

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