Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
1980_01_01_erdos_szemeredi: Erdős and Szemerédi bound the count of consecutive pairs with least common multiple at most x by (1.8600... + o(1)) x^{1/2} and its liminf over x^{1/2} by 1, which the positive integers attain; Mat. Lapok 28 (1980), refereed.
Linked from (1)
Graph