Digit sum

Last updated February 28, 2024

In mathematics, the digit sum of a natural number in a given number base is the sum of all its digits. For example, the digit sum of the decimal number $9045$ would be $9+0+4+5=18.$

Definition

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

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

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

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 $F_{10}(84001)=8+4+0+0+1=13.$

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

\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]

Extension to negative integers

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

Properties

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

$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}}$

Applications

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.

Related Research Articles

In mathematics, modular arithmetic is a system of arithmetic for integers, where numbers "wrap around" when reaching a certain value, called the modulus. The modern approach to modular arithmetic was developed by Carl Friedrich Gauss in his book Disquisitiones Arithmeticae, published in 1801.

<span class="mw-page-title-main">Prime number</span> Number divisible only by 1 or itself

A prime number is a natural number greater than 1 that is not a product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime because the only ways of writing it as a product, 1 × 5 or 5 × 1, involve 5 itself. However, 4 is composite because it is a product (2 × 2) in which both numbers are smaller than 4. Primes are central in number theory because of the fundamental theorem of arithmetic: every natural number greater than 1 is either a prime itself or can be factorized as a product of primes that is unique up to their order.

<span class="mw-page-title-main">Quadratic reciprocity</span> Gives conditions for the solvability of quadratic equations modulo prime numbers

In number theory, the law of quadratic reciprocity is a theorem about modular arithmetic that gives conditions for the solvability of quadratic equations modulo prime numbers. Due to its subtlety, it has many formulations, but the most standard statement is:

In number theory, a Liouville number is a real number $with the property that, for every positive integer, there exists a pair of integers with such that$

Casting out nines is any of three arithmetical procedures:

In mathematics, a harshad number in a given number base is an integer that is divisible by the sum of its digits when written in that base. Harshad numbers in base $n$ are also known as $n$ -harshad numbers. Harshad numbers were defined by D. R. Kaprekar, a mathematician from India. The word "harshad" comes from the Sanskrit harṣa (joy) + da (give), meaning joy-giver. The term "Niven number" arose from a paper delivered by Ivan M. Niven at a conference on number theory in 1977.

A divisibility rule is a shorthand and useful way of determining whether a given integer is divisible by a fixed divisor without performing the division, usually by examining its digits. Although there are divisibility tests for numbers in any radix, or base, and they are all different, this article presents rules and examples only for decimal, or base 10, numbers. Martin Gardner explained and popularized these rules in his September 1962 "Mathematical Games" column in Scientific American.

In mathematical notation for numbers, a signed-digit representation is a positional numeral system with a set of signed digits used to encode the integers.

In mathematics, Hensel's lemma, also known as Hensel's lifting lemma, named after Kurt Hensel, is a result in modular arithmetic, stating that if a univariate polynomial has a simple root modulo a prime number $p$ , then this root can be lifted to a unique root modulo any higher power of $p$ . More generally, if a polynomial factors modulo $p$ into two coprime polynomials, this factorization can be lifted to a factorization modulo any higher power of $p$ .

Bijective numeration is any numeral system in which every non-negative integer can be represented in exactly one way using a finite string of digits. The name refers to the bijection that exists in this case between the set of non-negative integers and the set of finite strings using a finite set of symbols.

In number theory, a Dudeney number in a given number base $is a natural number equal to the perfect cube of another natural number such that the digit sum of the first natural number is equal to the second. The name derives from Henry Dudeney, who noted the existence of these numbers in one of his puzzles, Root Extraction, where a professor in retirement at Colney Hatch postulates this as a general method for root extraction.$

A decimal representation of a non-negative real number $r$ is its expression as a sequence of symbols consisting of decimal digits traditionally written with a single separator:

In number theory, a narcissistic number in a given number base $is a number that is the sum of its own digits each raised to the power of the number of digits.$

In mathematics, trailing zeros are a sequence of 0 in the decimal representation of a number, after which no other digits follow.

The digital root of a natural number in a given radix is the value obtained by an iterative process of summing digits, on each iteration using the result from the previous iteration to compute a digit sum. The process continues until a single-digit number is reached. For example, in base 10, the digital root of the number 12345 is 6 because the sum of the digits in the number is 1 + 2 + 3 + 4 + 5 = 15, then the addition process is repeated again for the resulting number 15, so that the sum of 1 + 5 equals 6, which is the digital root of that number. In base 10, this is equivalent to taking the remainder upon division by 9, which allows it to be used as a divisibility rule.

In number theory, the multiplicative digital root of a natural number $in a given number base is found by multiplying the digits of together, then repeating this operation until only a single-digit remains, which is called the multiplicative digital root of . The multiplicative digital root for the first few positive integers are:$

A repeating decimal or recurring decimal is a decimal representation of a number whose digits are periodic and the infinitely repeated portion is not zero. It can be shown that a number is rational if and only if its decimal representation is repeating or terminating. For example, the decimal representation of 1/3 becomes periodic just after the decimal point, repeating the single digit "3" forever, i.e. 0.333.... A more complicated example is 3227/555, whose decimal becomes periodic at the second digit following the decimal point and then repeats the sequence "144" forever, i.e. 5.8144144144.... At present, there is no single universally accepted notation or phrasing for repeating decimals. Another example of this is 593/53, which becomes periodic after the decimal point, repeating the 13-digit pattern "1886792452830" forever, i.e. 11.18867924528301886792452830....

The Kempner series is a modification of the harmonic series, formed by omitting all terms whose denominator expressed in base 10 contains the digit 9. That is, it is the sum

The Bailey–Borwein–Plouffe formula is a formula for $π$ . It was discovered in 1995 by Simon Plouffe and is named after the authors of the article in which it was published, David H. Bailey, Peter Borwein, and Plouffe. Before that, it had been published by Plouffe on his own site. The formula is:

In number theory, a perfect digital invariant (PDI) is a number in a given number base ( $) that is the sum of its own digits each raised to a given power ().$

References

↑ Bush, L. E. (1940), "An asymptotic formula for the average sum of the digits of integers", American Mathematical Monthly , Mathematical Association of America, 47 (3): 154–156, doi:10.2307/2304217, JSTOR 2304217 .
↑ Borwein, J. M.; Borwein, P. B. (1992), "Strange series and high precision fraud" (PDF), American Mathematical Monthly , 99 (7): 622–640, doi:10.2307/2324993, hdl: 1959.13/1043650 , JSTOR 2324993, archived from the original (PDF) on 2016-05-09, retrieved 2009-03-02.
↑ Bloch, R. M.; Campbell, R. V. D.; Ellis, M. (1948), "The Logical Design of the Raytheon Computer", Mathematical Tables and Other Aids to Computation, American Mathematical Society, 3 (24): 286–295, doi:10.2307/2002859, JSTOR 2002859 .
↑ Edgeworth, F. Y. (1888), "The Mathematical Theory of Banking" (PDF), Journal of the Royal Statistical Society, 51 (1): 113–127, archived from the original (PDF) on 2006-09-13.

External links

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.

[lebush-1] Bush, L. E. (1940), "An asymptotic formula for the average sum of the digits of integers", American Mathematical Monthly , Mathematical Association of America, 47 (3): 154–156, doi:10.2307/2304217, JSTOR 2304217 .

[2] Borwein, J. M.; Borwein, P. B. (1992), "Strange series and high precision fraud" (PDF), American Mathematical Monthly , 99 (7): 622–640, doi:10.2307/2324993, hdl: 1959.13/1043650 , JSTOR 2324993, archived from the original (PDF) on 2016-05-09, retrieved 2009-03-02.

[3] Bloch, R. M.; Campbell, R. V. D.; Ellis, M. (1948), "The Logical Design of the Raytheon Computer", Mathematical Tables and Other Aids to Computation, American Mathematical Society, 3 (24): 286–295, doi:10.2307/2002859, JSTOR 2002859 .

[4] Edgeworth, F. Y. (1888), "The Mathematical Theory of Banking" (PDF), Journal of the Royal Statistical Society, 51 (1): 113–127, archived from the original (PDF) on 2006-09-13.

[1]

[2]

[3]

[4]