Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2025_08_08_gafni_tao: Proves that all but O(X / (log X)^2) of the prime gaps starting in [X, 2X] contain an integer whose least prime factor is at least the gap, so the question holds for almost all n; site-credited, Lean-proved outside here.
Linked from (1)
Graph