2000 character limit reached
Diophantine approximations with Fibonacci numbers
Published 28 Dec 2011 in math.NT | (1112.6142v1)
Abstract: Let $F_{n}$ be the $n$-th Fibonacci number. Put $\varphi=\frac{1+\sqrt5}{2}$. We prove that the following inequalities hold for any real $\alpha$: 1) $\inf_{n \in \mathbb N} ||F_n\alpha||\le\frac{\varphi-1}{\varphi+2}$, 2) $\liminf_{n\to \infty}||F_n\alpha||\le 1/5$, 3) $\liminf_{n \to \infty}||\varphin \alpha||\le 1/5$. These results are the best possible.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.