Abstract
Abstract Given an integral, increasing, linear-recurrent sequence A with initial term 1, the greedy algorithm may be used on the terms of A to represent all positive integers. For large classes of recurrences, the average digit sum is known to equal cA log n+O(1), where cA is a positive constant that depends on A. This asymptotic result is re-proved with an elementary approach for a class of special recurrences larger than, or distinct from, that of former papers. The focus is on the constants cA for which, among other items, explicit formulas are provided and minimal values are found, or conjectured, for all special recurrences up to a certain order.
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.
