Abstract
I t is straightforward, but tedious, to write down the integers whose representations in a given base do not have particular digits in certain positions. In the first section of this paper we give a computational scheme that enables us to carry out such operations in a rapid and simple fashion.In the second section of the paper we derive a general identity involving the digits of integers in arbitrary Cantor systems of notation.In the third section we apply this identity and deduce a number of results concerned with the splitting of integers into classes with equal power sums. The computational scheme of the first section leads us to an algorithm for the determination of such splittings.
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.
