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

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

FormalConjectures/ErdosProblems/277.lean

Formal Conjectures

FormalConjectures/ErdosProblems/277.leanErdos277.erdos_2771 lineExact file

1True ↔ ∀ (c : ℝ), ∃ n, ↑((ArithmeticFunction.sigma 1) n) > c * ↑n ∧ ∀ (m : StrictCoveringSystem ℤ), ∃ i, ↑n ∉ m.moduli i

SolvedStatement only, no proof