Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2026_04_13_price: A proof found by GPT-5.4 Pro and submitted by Price that the sum of one over a log a over a primitive set above x is at most one plus a constant over log x; written up by Alexeev and seven coauthors and formalized by Math Inc.
2026_04_16_sothanaphan: Three notes, with GPT-5.4 Thinking, sharpening the bound for primitive sets above x to one plus gamma over log x plus O(1/log^2 x) and recasting the argument as a pure resummation; credited in the paper's Remark 4.1, pending.
Linked from (1)
Graph