Abstract

Let $\alpha$ be a real number, $N$ a positive integer and $\mathcal N$ a subset of $\{0,1,2,\dots ,N\}$. We give an upper bound for the number of distinct lengths of gaps between the fractional parts $\{ n\alpha \},\;n\in \mathcal N$.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call