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 statement9 of 11

$h(6) = 2$ : divisors are {1, 2, 3, 6}. The hardest m to represent is m=4 or m=5, each requiring 2 divisors: 4=1+3, 5=2+3.

FormalConjectures/ErdosProblems/18.leanErdos18.practicalH_six1 lineExact file

1Erdos18.practicalH 6 = 2

TestStatement only, no proof