Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2503.01788 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- For a real number $θ$, let $\Vertθ\Vert$ denote the distance from $θ$ to the nearest integer. A set of positive integers $\mathcal H$ is a Heilbronn set if for every $α\in \mathbb R$ and every $ε>0$ there exists $h\in\mathcal H$ such that $\Vert hα\Vert<ε$ (see \cite{montgomery} 2.7). The natural numbers are a Heilbronn set by Dirichlet's approximation theorem. Vinogradov \cite{vinogradov} showed that for a natural number $k$, the $k$th powers of integers are a Heilbronn set. In this paper we give a constructive proof that the Fibonacci sequence is not a Heilbronn set, but conversely that almost all $α$ satisfy $\liminf_{n\to\infty}\Vert F_nα\Vert=0$. However, we exhibit a real number $α$ such that $\Vert F_nα\Vert>0.14$ for all $n$.