The sum-of-digits function on arithmetic progressions

From MaRDI portal
Publication:2299252




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.









This page was built for publication: The sum-of-digits function on arithmetic progressions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2299252)