On digits of Mersenne numbers
From MaRDI portal
Publication:2104853
Summary: Motivated by recently developed interest to the distribution of \(q\)-ary digits of Mersenne numbers \(M_p = 2^p - 1\), where \(p\) is prime, we estimate rational exponential sums with \(M_p\), \(p \leq X\), modulo a large power of a fixed odd prime \(q\). In turn this immediately implies the normality of strings of \(q\)-ary digits amongst about \((\log X)^{3{/} 2 + o (1)}\) rightmost digits of \(M_p\), \(p \leq X\). Previous results imply this only for about \((\log X)^{1 + o (1)}\) rightmost digits.
Recommendations
Cites work
- A local Benford Law for a class of arithmetic sequences
- Complexity of leading digit sequences
- Effective Vinogradov's mean value theorem via efficient boxing
- Estimation of Kloosterman sums with primes and its application
- Exponential and character sums with Mersenne numbers
- Exponential sums over Mersenne numbers
- scientific article; zbMATH DE number 3708485 (Why is no real title available?)
- scientific article; zbMATH DE number 2121181 (Why is no real title available?)
- Leading digits of Mersenne numbers
- ON THE DISTRIBUTION OF DIGITS IN PERIODIC FRACTIONS
- Proof of the main conjecture in Vinogradov's mean value theorem for degrees higher than three
- Sequences, discrepancies and applications
- The cubic case of the main conjecture in Vinogradov's mean value theorem
- VINOGRADOV'S INTEGRAL AND BOUNDS FOR THE RIEMANN ZETA FUNCTION
Cited in
(5)- scientific article; zbMATH DE number 6699315 (Why is no real title available?)
- scientific article; zbMATH DE number 3163832 (Why is no real title available?)
- Distribution of recursive matrix pseudorandom number generator modulo prime powers
- On digits of Mersenne numbers
- Collisions of digit sums in bases 2 and 3
This page was built for publication: On digits of Mersenne numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104853)
