Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2024_07_13_ford: For every K the close divisor pairs of n outnumber K times its divisors on a set of positive density, so the inequality cannot hold for almost all n; deduced by Kevin Ford from the dyadic divisor count of Problem 448.
Linked from (1)
Graph