Skip to content

Erdős problem 825

Start work

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?

How the state got here

1 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingA Result stands here
  6. Next gapNot recorded

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:f18c58048e60eae30b471b6ce5726b93a8753b8a1f984d0d3d331fa6d82f197a
Metadata
sha256:23beea08de02fb87dc57a756c7f46fbcd2b2be26e2ef04dc7e02d0e0e9cc9066
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:aec5d8e680774e533d2174fa1077edcb618e3fdc28a0f54c5aadffbc0f6a779f
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON