Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2013_03_08_chan: Chan proves that every large perfect square has at most five divisors within c times its fourth root of its square root, for each c of at least three, answering the question for squares with K equal to five.
2014_06_09_chan: Chan proves that every large n equal to (N - a)(N + b), with 0 <= a <= b <= exp((log n)^(2/7)), has at most eighteen divisors within n^(1/4) (log n)^(1/14) of its square root.
Linked from (1)
Graph