Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claim. For every sequence , with , there are infinitely many with ; in particular . The same paper shows that some sequences have for every , a bound that is not and so leaves the second question of Problem 987 open.
Covers. The first question: for every sequence, with the rate in place of Erdős's . The second question, whether is possible, is answered by the 2026 construction.
Depends on. Nothing in this wiki; the result rests on the cited paper alone.
Earlier and later bounds. The site records that Erdős remarked in 1964 that the variant with in place of is easily seen to be unbounded in , and that in 1965 he gave a short proof of for infinitely many , which already answers the first question (Erdős's claim page); Clunie's bound is the first of power type. For sequences that take only finitely many distinct values, Liu's 1969 bound for infinitely many is on Liu's claim page. The 2025 forum proof and Lean formalization of the first question are on Tao's claim page.
Dating. The page is dated by the publication year. The journal record (J. London Math. Soc. 42 (1967), 133–136) gives no day, and the day in the page name is a placeholder.
Formalization. The contributor's fork of formal-conjectures linked
above states Clunie's bound as erdos_987.variants.sqrt_lower_bound and
his linear upper bound as erdos_987.variants.linear_upper_bound, with
proofs its comments attribute to the lemmas of the 1967 paper; the
repository's main branch points its formal_proof attributes at that file.
Not built or audited here, so it adds no evidence kind.
Acceptance. Refereed: J. London Math. Soc. 42 (1967), 133–136. Reviewed: the site's curator, Thomas Bloom, labels the problem PROVED (LEAN) and credits Clunie in the problem's commentary with for infinitely many and with sequences having for all (page last edited 2026-04-09). The curator is independent of the author. The statements above follow the site's record of the paper.