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?

Erdős Problems records this as proved.

No Repository has ruled on it here.

How far the record reaches4 of 6 stages
  1. Sourceerdos-problems
  2. StatementRetained
  3. Formal1 retained
  4. Resolutionproved
  5. WorkNone recorded
  6. DecisionNone here
  7. The questionNot reached
What this record is missingWork

Nothing here has checked that finding.

Reproducing it here turns a report into evidence.

Open the work surface
Where the source files it579 share a topic
Number Theory576Covering Systems22
Erdős problem 321accepted
Carrying a Standing. Browse the topic.
Start workOpen sources