| CARVIEW |
Select Language
HTTP/2 200
date: Wed, 31 Dec 2025 00:24:05 GMT
content-type: text/html; charset=utf-8
nel: {"report_to":"cf-nel","success_fraction":0.0,"max_age":604800}
vary: Accept-Encoding
cache-control: no-store, max-age=0
pragma: no-cache
expires: 0
x-clacks-overhead: GNU Terry Pratchett
report-to: {"group":"cf-nel","max_age":604800,"endpoints":[{"url":"https://a.nel.cloudflare.com/report/v4?s=Cy8K%2BuPoxFqAnGfVB3CXsZ%2FSHKUzaxayBdTMCQECo7xtxUDUiugYo%2BMM3jpt0kiGTaPhDqvJqbhhQ8hk0xzcfcv2TCnWVMJYYZMcl074g2jbbwobaA%3D%3D"}]}
server: cloudflare
cf-cache-status: DYNAMIC
content-encoding: gzip
cf-ray: 9b65a1c63e093a93-BOM
alt-svc: h3=":443"; ma=86400
Erdős Problem #480
PROVED
This has been solved in the affirmative.
Let $x_1,x_2,\ldots\in [0,1]$ be an infinite sequence. Is it true that\[\inf_n \liminf_{m\to \infty} n \lvert x_{m+n}-x_m\rvert\leq 5^{-1/2}\approx 0.447?\]
A conjecture of Newman. This was proved by Chung and Graham [ChGr84], who in fact prove that\[\inf_n \liminf_{m\to \infty} n \lvert x_{m+n}-x_m\rvert\leq \frac{1}{c}\approx 0.3944\]where\[c=1+\sum_{k\geq 1}\frac{1}{F_{2k}}=2.535\cdots\]and $F_m$ is the $m$th Fibonacci number. They also prove that this constant is best possible (van Doorn discusses their construction in the comments).
This page was last edited 28 December 2025.
2 comments on this problem
| Likes this problem | None |
| Interested in collaborating | None |
| Currently working on this problem | None |
| This problem looks difficult | None |
| This problem looks tractable | None |
Additional thanks to: Salvatore Mercuri and Wouter van Doorn
When referring to this problem, please use the original sources of Erdős. If you wish to acknowledge this website, the recommended citation format is:
T. F. Bloom, Erdős Problem #480, https://www.erdosproblems.com/480, accessed 2025-12-31
When referring to this problem, please use the original sources of Erdős. If you wish to acknowledge this website, the recommended citation format is:
T. F. Bloom, Erdős Problem #480, https://www.erdosproblems.com/480, accessed 2025-12-31
