Erdős problem 886
Let . Is it true that, for all large , the number of divisors of in is ?
Sources
FormalConjectures/ErdosProblems/
886.lean
Retained formal statement
Let . Is it true that, for all large , the number of divisors of in is ?
Erdős attributes this conjecture to Ruzsa.
sorry ↔ ∀ ε > 0, ∃ K, ∀ᶠ (n : ℕ) in Filter.atTop, (Erdos886.Erdos886Divisors n ε 1).card ≤ KOpenStatement only, no proof