Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2014_12_16_ford_green_konyagin_maynard_tao: Display (1.2) of the 2018 long-gaps paper, inverted through the covering form, gives S(k) << k log_2 k/(log k log_3 k), a refereed upper bound implying the site's display; the displayed question stays open.
Linked from (1)
Graph