The sum-of-digits function on arithmetic progressions

From MaRDI portal
Publication:2299252

DOI10.2140/MOSCOW.2020.9.43zbMATH Open1468.11023arXiv1909.08849OpenAlexW3104010831MaRDI QIDQ2299252FDOQ2299252


Authors: Lukas Spiegelhofer, Thomas Stoll Edit this on Wikidata


Publication date: 21 February 2020

Published in: Moscow Journal of Combinatorics and Number Theory (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1909.08849




Recommendations




Cites Work


Cited In (13)





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)