Erdős problem 18 · problems.science

Conjecture 1. Are there infinitely many practical numbers $m$ such that $h(m) < (\log \log m)^{O(1)}$ ?

Sources

Browse retained paths and inspect the exact material available for this Problem.

11 retained statements2415f78e850a

FormalConjectures/ErdosProblems/

18.lean

Retained formal statement1 of 11

Erdős's Theorem. Erdős proved that $h(n!) < n$ for all $n \ge 1$ .

FormalConjectures/ErdosProblems/18.leanErdos18.erdos_18_upper_bound1 lineExact file

1∀ᶠ (n : ℕ) in Filter.atTop, Erdos18.practicalH n.factorial < n

SolvedStatement only, no proof