Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2026_06_27_li: Eric Li's arXiv preprint, written with GPT-5.5 Pro, pins the density-tight scale of the least non-divisor of the central binomial coefficient and proves that no dyadically regular f has m asymptotic to f(n) in density.
Linked from (1)
Graph