Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2026_09_05_land: An AI-assisted manuscript claiming that for o(log X) shifts in [1,X] some prime in (2X,3X] avoids them all by composite differences, hence infinitely many primes p with p - k! composite for every k! < p; a tab claim, pending.
Linked from (1)
Graph