Erdős problem 377
Is there some absolute constant such that for all ?
Sources
FormalConjectures/ErdosProblems/
377.lean
Retained formal statement
Is there some absolute constant such that for all ?
True ↔ ∃ C > 0, ∀ (n : ℕ), Erdos377.sumInvPrimesNotDvdCentralBinom n ≤ COpenStatement only, no proof