Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2026_09_25_openai: The OpenAI release's theorem that for every fixed C a positive proportion of consecutive prime gaps exceed C log p_n, with the corollary that the n with p_n/n < p_{n+1}/(n+1) have positive lower density; accepted on its built Lean proof.
Linked from (1)
Graph