Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
1959_01_05_kahane: Kahane proves a sufficient and a necessary condition for random arcs of nonincreasing lengths below one to cover the circle almost surely, which give the lengths (1+c)/n the site credits to him; refereed.
1972_09_01_shepp: Shepp's necessary and sufficient condition for independent uniform random arcs of nonincreasing lengths to cover the whole circle with probability one; refereed, and credited by the site as the solution.
Linked from (1)
Graph