Abstract
Let t(n) denote the number of 1-bits in the base-2 representation of n, taken modulo 2. We show how to prove the classic conjecture of Leo Moser, on the rarefied sum ∑0≤i<n(−1)t(3i), using tools from automata theory and logic. The same technique can be used to prove results about analogous sums.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Similar Papers
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.