Erdős problem 887
Is there an absolute constant such that, for every , if is sufficiently large then has at most divisors in .
Sources
FormalConjectures/ErdosProblems/
887.lean
Retained formal statement
Erdős and Rosenfeld, ask whether is the best possible for the infinitude of with (at least) divisors in .
IsGreatest {K | ∃ C > 0, Infinite ↑{n | K ≤ {d ∈ Finset.Ioo ⌊√↑n⌋₊ ⌈√↑n + C * ↑n ^ (1 / 4)⌉₊ | d ∣ n}.card}} 4OpenStatement only, no proof