Abstract
We study representations of integers n in binary expansions using the digits 0,±1. We analyze the average number of such representations of minimal weight (= number of non-zero digits). The asymptotic main term of this average involves a periodically oscillating function, which is analyzed in some detail. The main tool is the construction of a measure on [?1,1], which encodes the number of representations.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
