Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2026_07_26_white: A working report bounds the longest interval in [x,2x] on which every integer has more than log log n distinct prime factors by exp((1+o(1)) log x/log log x); pending.
Linked from (1)
Graph