Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claim. For every sequence on the unit circle there is a such that
for infinitely many ; in particular . This is Wagner, On a problem of Erdős in Diophantine approximation, Bull. London Math. Soc. 12 (1980), no. 2, 81–88, cited as [Wa80] on the problem page. It answers the first question of [[problems/polynomials/E0119/_index|Problem 119]], which the site records as Problem 4.1 of Hayman's 1974 collection [Ha74], attributed there to Erdős.
Covers. The first question only, that . It does not reach a power of , which is the second question, answered by Beck 1991, nor the sum of the third question, answered by Korsky 2026.
Depends on. No page of this wiki.
Acceptance. Refereed: the paper appeared in the Bulletin of the London Mathematical Society in March 1980. Reviewed: erdosproblems.com states that the weaker conjecture was proved by Wagner with the bound infinitely often (page last edited 2026-09-01), which the corpus counts as documented independent acceptance by the site's curator, T. F. Bloom (erdosproblems.com). Proof coverage: none; the paper is not held in the library.