# Digit sum

Digit sum

In mathematics, the digit sum of a given integer is the sum of all its digits, (e.g.: the digit sum of 84001 is calculated as 8+4+0+0+1 = 13). Digit sums are most often computed using the decimal representation of the given number, but they may be calculated in any other base; different bases give different digit sums, with the digit sums for binary being on average smaller than those for any other base.

Let S(r,N) be the digit sum for radix r of all non-negative integers less than N. For any 2 ≤ r1 < r2 and for sufficiently large N, S(r1,N) < S(r2,N).

The sum of the decimal digits of the integers 0, 1, 2, ... is given by in the On-Line Encyclopedia of Integer Sequences. Borwein & Borwen (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.

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 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.

Digit sums are also a common ingredient in checksum algorithms and were used in this way to check the arithmetic operations of early computers. 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.

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. Perry (2005) studies the question of how many integers are mapped to the same value by the sum-of-digits function.

6% of the numbers below 100000 have a digit sum of 23, which is along with 22 the most common digit sum within this limit. 

Wikimedia Foundation. 2010.

### Look at other dictionaries:

• Sum-product number — A sum product number is an integer that in a given base is equal to the sum of its digits times the product of its digits. Or, to put it algebraically, given an integer n that is l digits long in base b (with d x representing the x th digit), ifn …   Wikipedia

• Sum addressed decoder — In CPU design, a Sum Addressed Decoder or Sum Addressed Memory (SAM) Decoder is a method of reducing the latency of the CPU cache access. This is achieved by fusing the address generation sum operation with the decode operation in the cache… …   Wikipedia

• Sum-Of-The-Years' Digits — An accelerated method for calculating an asset s depreciation. This method takes the asset s expected life and adds together the digits for each year. So if the asset was expected to last for five years, the sum of the years’ digits would… …   Investment dictionary

• Check digit — A check digit is a form of redundancy check used for error detection, the decimal equivalent of a binary checksum. It consists of a single digit computed from the other digits in the message. With a check digit, one can detect simple errors in… …   Wikipedia

• Digital sum — There are a number of common mathematical meanings of the term digital sum: Values The digit sum add the digits of the representation of a number in a given base. For example, considering 84001 in base 10 the digit sum would be… …   Wikipedia

• sum of years digit depreciation — method of calculating accelerated depreciation of goods that assumes a more rapid loss of value during the first years of a product s life cycle (Accounting) …   English contemporary dictionary

• Subset sum problem — In computer science, the subset sum problem is an important problem in complexity theory and cryptography. The problem is this: given a set of integers, does the sum of some non empty subset equal exactly zero? For example, given the set { −7, −3 …   Wikipedia

• Perfect digit-to-digit invariant — A perfect digit to digit invariant (PDDI) (also known as a Munchausen number) is a number that is equal to the sum of its digits each raised to a power equal to the digit. 0 and 1 are PDDIs in any base (using the convention that 00 = 0). Apart …   Wikipedia

• Метод суммы цифр лет (SUM-OF-YEARS-DIGIT (SYD) DEPRECIATION METHOD)  — Метод ускоренной амортизации. В соответствии с данным методом (а) суммируются цифры (1,2,3…n) лет периода амортизации актива и (б) берется в качестве нормы амортизации для каждого года дробь, в числитель которой подставляются цифры года, взятые в …   Словарь терминов по управленческому учету

• Luhn-Algorithmus — Der Luhn Algorithmus oder die Luhn Formel, auch bekannt als „Modulo 10“ oder „mod 10“ Algorithmus und als Double Add Double Methode, wurde in den 1960er Jahren von Hans Peter Luhn als eine Methode der Überprüfung von Identifikationsnummern… …   Deutsch Wikipedia