Digit sum

Let ${\displaystyle n}$  be a natural number. We define the digit sum for base ${\displaystyle b>1}$ , ${\displaystyle F_{b}:\mathbb {N} \rightarrow \mathbb {N} }$  to be the following:

${\displaystyle F_{b}(n)=\sum _{i=0}^{k}d_{i}}$ 

where ${\displaystyle k=\lfloor \log _{b}{n}\rfloor }$  is one less than the number of digits in the number in base ${\displaystyle b}$ , and

${\displaystyle d_{i}={\frac {n{\bmod {b^{i+1}}}-n{\bmod {b}}^{i}}{b^{i}}}}$ 

is the value of each digit of the number.

For example, in base 10, the digit sum of 84001 is ${\displaystyle F_{10}(84001)=8+4+0+0+1=13.}$ 

For any two bases ${\displaystyle 2\leq b_{1}<b_{2}}$  and for sufficiently large natural numbers ${\displaystyle n,}$ 

${\displaystyle \sum _{k=0}^{n}F_{b_{1}}(k)<\sum _{k=0}^{n}F_{b_{2}}(k).}$ ^[1]

The sum of the base 10 digits of the integers 0, 1, 2, ... is given by OEIS: A007953 in the On-Line Encyclopedia of Integer Sequences. Borwein & Borwein (1992) use the generating function of this integer sequence (and of the analogous sequence for binary digit sums) to derive several rapidly converging series with rational and transcendental sums.^[2]

The digit sum can be extended to the negative integers by use of a signed-digit representation to represent each integer.

The amount of n-digit numbers with digit sum q can be calculated using:

${\displaystyle f(n,q)={\begin{cases}1&{\text{if }}n=1\\f(n,9n-q+1)&{\text{if }}q>\lceil {\frac {9n}{2}}\rceil \\\sum _{i=\max(q-9,1)}^{q}f(n-1,i)&{\text{otherwise}}\end{cases}}}$ 

The concept of a decimal digit sum is closely related to, but not the same as, the digital root, which is the result of repeatedly applying the digit sum operation until the remaining value is only a single digit. The decimal digital root of any non-zero integer will be a number in the range 1 to 9, whereas the digit sum can take any value. Digit sums and digital roots can be used for quick divisibility tests: a natural number is divisible by 3 or 9 if and only if its digit sum (or digital root) is divisible by 3 or 9, respectively. For divisibility by 9, this test is called the rule of nines and is the basis of the casting out nines technique for checking calculations.

Digit sums are also a common ingredient in checksum algorithms to check the arithmetic operations of early computers.^[3] Earlier, in an era of hand calculation, Edgeworth (1888) suggested using sums of 50 digits taken from mathematical tables of logarithms as a form of random number generation; if one assumes that each digit is random, then by the central limit theorem, these digit sums will have a random distribution closely approximating a Gaussian distribution.^[4]

The digit sum of the binary representation of a number is known as its Hamming weight or population count; algorithms for performing this operation have been studied, and it has been included as a built-in operation in some computer architectures and some programming languages. These operations are used in computing applications including cryptography, coding theory, and computer chess.

Harshad numbers are defined in terms of divisibility by their digit sums, and Smith numbers are defined by the equality of their digit sums with the digit sums of their prime factorizations.

• Arithmetic dynamics
• Casting out nines
• Checksum
• Digital root
• Hamming weight
• Harshad number
• Perfect digital invariant
• Sideways sum
• Smith number
• Sum-product number

• Weisstein, Eric W. "Digit Sum". MathWorld.