Erdős problem 277 · problems.science

Is it true that, for every $c$ , there exists an $n$ such that $\sigma(n)>cn$ but there is no covering system whose moduli all divide $n$ ?

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.

No correction history

Technical detailsExact roots, source, and retained record identifiers

Problem row: sha256:38af99bcc7c73ac4f6a17a2e751002cf3809d3dbc7533bb44a73e6c6579cf972
Metadata: sha256:95737696d909825ea542a63409d13ce2df0dd6cc6e44c9aa6e7f035672b0c1ac
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:e66b8ada7c6b97770116310ccc6daa10423e43797f52a188cc957d0117114797

Repository: sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection: sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit: 2415f78e850aeee50afdca525c6f2e0ea606f207