Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2026_04_08_bloom: The site curator's own commentary argument, a pigeonhole upper bound and a random-plus-greedy lower bound giving F(x) = log x + O(sqrt(log x log log x)); no paper, preprint or independent review exists, so it is pending.
Linked from (1)
Graph