Skip to content

Erdős problem 277

Start work

Is it true that, for every cc, there exists an nn such that σ(n)>cn\sigma(n)>cn but there is no covering system whose moduli all divide 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:38af99bcc7c73ac4f6a17a2e751002cf3809d3dbc7533bb44a73e6c6579cf972
Metadata
sha256:95737696d909825ea542a63409d13ce2df0dd6cc6e44c9aa6e7f035672b0c1ac
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:e66b8ada7c6b97770116310ccc6daa10423e43797f52a188cc957d0117114797
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON