Documentation

FormalConjectures.ErdosProblems.«277»

Erdős Problem 277 #

References:

theorem Erdos277.erdos_277 :
True ∀ (c : ), ∃ (n : ), ((ArithmeticFunction.sigma 1) n) > c * n ∀ (m : StrictCoveringSystem ), ∃ (i : m.ι), nm.moduli i

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$?

This was answered affirmatively by Haight [Ha79].