Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2026_01_30_leeham: A GPT-5.2 Pro proof posted by the forum account Leeham, formalized in Lean by Aristotle, that a set in the first N integers with no difference of at least t dividing the larger element has at most (1/2 + o_t(1))N elements.
Linked from (1)
Graph