Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2026_04_27_li: Li's April 2026 manuscript, produced with GPT-5.5 Pro, constructs a good sequence of primes with log u_n = sqrt n + O(n^{-1/2}), so u_n <= e^{o(n)}; the first question is not touched.
Linked from (1)
Graph