Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
1988_01_01_heath_brown: Heath-Brown proves that every sufficiently large integer is a sum of at most three 2-powerful numbers, the case r = 2 of the problem; the site's curator credits the result on Problem 941, whose statement is exactly this case.
Linked from (1)
Graph