Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2026_06_24_price: Infinitely many n have 2n choose n and 2n+2 choose n+1 with the same prime divisors, at least a constant times the square root of x of them below x; an argument of GPT Pro accepted by the site and formalized by Blair.
Linked from (1)
Graph