The sum-of-digits function on arithmetic progressions
Abstract
Let s2 be the sum-of-digits function in base 2, which returns the number of non-zero binary digits of a nonnegative integer n. We study s2 alon g arithmetic subsequences and show that --- up to a shift --- the set of m-tuples of integers that appear as an arithmetic subsequence of s2 has full complexity.
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.