An algorithm for studying the digit sum of large integers

Abstract

Let M denote the largest integer representable on a computer. Then only (part of) integers of digits or less can be represented. However, using the algorithm of this paper we can study the digit sum of integers of as many as [M/9] digits. This algorithm can evaluate the proportion of integers whose digit sum satisfies certain given conditions. The implementation of this algorithm does not require large memory space. The algorithm is also very suitable to parallel computing. An application of this algorithm is presented. A mathematical conjecture related to this algorithm is also raised.

Keywords:

• Integer Representation
• Digit Sum
• Proportion Computation

C.R. Categories:

• G2.1