The Rudin-Shapiro sequence and similar sequences are normal along squares
Abstract
We prove that digital sequences modulo m along squares are normal, which covers some prominent sequences like the sum of digits in base q modulo m, the Rudin-Shapiro sequence and some generalizations. This gives, for any base, a class of explicit normal numbers that can be efficiently generated.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.