Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
1978_01_01_erdos_selfridge: For u = k^2 primes, every interval longer than 2p_u holds at least 2k distinct multiples of them, and for every α < 3 some primes and an interval of length αp_u hold exactly 2k; a proceedings paper, pending acceptance.
Linked from (1)
Graph