Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2026_06_24_li: Li's preprint of June 2026, written with GPT-5.5 Pro, claims that the number of ordered pairs with a plus b at most x and sigma(a) plus sigma(b) equal to sigma(a plus b) exceeds x times every power of log x, so is not order cx.
Linked from (1)
Graph