Abstract
AbstractWe prove that digital sequences modulomalong squares are normal, which covers some prominent sequences, such as the sum of digits in baseqmodulom, the Rudin–Shapiro sequence, and some generalizations. This gives, for any base, a class of explicit normal numbers that can be efficiently generated.
Full Text
Submitted Version (
Free)
Published Version
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