Abstract
Let $${\mathcal{A}}$$ be a finite subset of $${\mathbb{N}}$$ containing 0, and let f (n) denote the number of ways to write n in the form $${\sum \varepsilon _{j}2^{j}}$$ , where $${\varepsilon _{j} \epsilon \mathcal{A}}$$ . We show that there exists a computable $${T = T (\mathcal{A})}$$ so that the sequence (f (n) mod 2) is periodic with period T. Variations and generalizations of this problem are also discussed.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.