On digit patterns in expansions of rational numbers with prime denominator
classification
🧮 math.NT
keywords
almostvarepsilonexpansionlengthprimesstringsassertsbourgain
read the original abstract
We show that, for any fixed $\varepsilon > 0$ and almost all primes $p$, the $g$-ary expansion of any fraction $m/p$ with $\gcd(m,p) = 1$ contains almost all $g$-ary strings of length $k < (5/24 - \varepsilon) \log_g p$. This complements a result of J. Bourgain, S. V. Konyagin, and I. E. Shparlinski that asserts that, for almost all primes, all $g$-ary strings of length $k < (41/504 -\varepsilon) \log_g p$ occur in the $g$-ary expansion of $m/p$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.