Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated

Claims

../

1976_01_01_sarkozy: Sárközy's Theorem of 1976: N(X, delta) is below (4 times 10^4 over delta cubed) X over log log X for X large, so N(X, delta) = o(X), the first question of Problem 465; refereed in Studia Sci. Math. Hungar.

2001_04_01_konyagin: Konyagin's Theorem of 2001: for every delta there is C(delta) with N(X, delta) < C(delta) root X for all X at least 1, which answers both questions of Problem 465; refereed in Mat. Zametki and credited by the site.