Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2026_04_24_chojecki: Przemek Chojecki's note of 24 April 2026, credited to GPT-5.5 Pro, proves h(x) >= c_0 (log x)^{1/3} for all large x by the Selberg upper-bound sieve on five-prime configurations; unrefereed, unreviewed, claimed.
2026_04_24_turturean: David Turturean's Overleaf write-up of 24 April 2026, made with a scaffold on ChatGPT-5.5-Pro, derives h(x) >> (log x)^{1/3} from a four-prime rectangle count and sketches a conditional bound of order log x; claimed.
Linked from (1)
Graph