Casting Out Nines

Casting out nines is any of three arithmetical procedures:
*Adding the decimal digits of a positive whole number, while optionally ignoring any 9s or digits which sum to 9 or a multiple of 9. The result of this procedure is a number which is smaller than the original whenever the original has more than one digit, leaves the same remainder as the original after division by nine, and may be obtained from the original by subtracting a multiple of 9 from it. The name of the procedure derives from this latter property.
*Repeated application of this procedure to the results obtained from previous applications until a single-digit number is obtained. This single-digit number is called the "digital root" of the original. If a number is divisible by 9, its digital root is 9. Otherwise, its digital root is the remainder it leaves after being divided by 9.
*A sanity test in which the above-mentioned procedures are used to check for errors in arithmetical calculations. The test is carried out by applying the same sequence of arithmetical operations to the digital roots of the operands as are applied to the operands themselves. If no mistakes are made in the calculations, the digital roots of the two resultants will be the same. If they are different, therefore, one or more mistakes must have been made in the calculations.

Digit sums

To "cast out nines" from a single number, its decimal digits can be simply added together to obtain its so-called digit sum. The digit sum of 2946, for example is 2 + 9 + 4 + 6 = 21. Since 21 = 2946 − 325 × 9, the effect of taking the digit sum of 2946 is to "cast out" 325 lots of 9 from it. If the digit 9 is ignored when summing the digits, the effect is to "cast out" one more 9 to give the result 12.

More generally, when casting out nines by summing digits, any set of digits which add up to 9, or a multiple of 9, can be ignored. In the number 3264, for example, the digits 3 and 6 sum to 9. Ignoring these two digits, therefore, and summing the other two, we get 2 + 4 = 6. Since 6 = 3264 − 362 × 9, this computation has resulted in casting out 362 lots of 9 from 3264.

For an arbitrary number, $10^n d_n + 10^ d_ + \cdots + d_0$, normally represented by the sequence of decimal digits, $d_nd_ \dots d_0$, the digit sum is $d_n + d_ + \cdots + d_0$. The difference between the original number and its digit sum is

: $\begin & 10^n d_n + 10^ d_ + \cdots + d_0 - \left(d_n + d_ + \cdots + d_0\right) \\ = & \left(10^n-1\right)d_n + \left(10^-1\right)d_ + \cdots + 9 d_1. \end$

Because numbers of the form $10^i -1$ are always divisible by 9 (since $10^i -1 = 9\times\left(10^ + 10^ + \cdots + 1\right)$), replacing the original number by its digit sum has the effect of casting out

: $\fracd_n + \fracd_ + \cdots + d_1$

lots of 9.

Digital roots

If the procedure described in the preceding paragraph is repeatedly applied to the result of each previous application, the eventual result will be a single-digit number from which ''all'' 9s, with the possible exception of one, have been "cast out". The resulting single-digit number is called the ''digital root'' of the original. The exception occurs when the original number has a digital root of 9, whose digit sum is itself, and therefore will not be cast out by taking further digit sums.

The number 12565, for instance, has digit sum 1+2+5+6+5 = 19, which, in turn, has digit sum 1+9=10, which, in its turn has digit sum 1+0=1, a single-digit number. The digital root of 12565 is therefore 1, and its computation has the effect of casting out (12565 - 1)/9 = 1396 lots of 9 from 12565.

Checking calculations by casting out nines

To check the result of an arithmetical calculation by casting out nines, each number in the calculation is replaced by its digital root and the same calculations applied to these digital roots. The digital root of the result of this calculation is then compared with that of the result of the original calculation. If no mistake has been made in the calculations, these two digital roots must be the same. Examples in which casting-out-nines has been used to check addition, subtraction, multiplication, and division are given below.

Examples

Addition

In each addend, cross out all 9s and pairs of digits that total 9, then add together what remains. These new values are called ''excesses''. Add up leftover digits for each addend until one digit is reached. Now process the sum and also the excesses to get a ''final'' excess.

Subtraction

Multiplication

^*8 times 8 is 64; 6 and 4 are 10; 1 and 0 are 1.

Division

How it works

The method works because the original numbers are 'decimal' (base 10), the modulus is chosen to differ by 1, and casting out is equivalent to taking a digit sum. In general any two 'large' integers, ''x'' and ''y'', expressed in any smaller ''modulus'' as ''x and ''y' '' (for example, modulo 7) will always have the same sum, difference or product as their originals. This property is also preserved for the 'digit sum' where the base and the modulus differ by 1.

If a calculation was correct before casting out, casting out on both sides will preserve correctness. However, it is possible that two previously unequal integers will be identical modulo 9 (on average, a ninth of the time).

The operation does not work on fractions, since a given fractional number does not have a unique representation.

A variation on the explanation

A trick to learn to add with nines is to add ten to the digit and to count back one. Since we are adding 1 to the tens digit and subtracting one from the units digit, the sum of the digits should remain the same. For example, 9 + 2 = 11 with 1 + 1 = 2. When adding 9 to itself, we would thus expect the sum of the digits to be 9 as follows: 9 + 9 = 18, (1 + 8 = 9) and 9 + 9 + 9 = 27, (2 + 7 = 9). Let us look at a simple multiplication: 5 × 7 = 35, (3 + 5 = 8). Now consider (7 + 9) × 5 = 16 × 5 = 80, (8 + 0 = 8) or 7 × (9 + 5) = 7 × 14 = 98, (9 + 8 = 17), (1 + 7 = 8).

Any non-negative integer can be written as 9×n + a, where 'a' is a single digit from 0 to 8, and 'n' is some non-negative integer.
Thus, using the distributive rule, (9×n + a)×(9×m + b)= 9×9×n×m + 9(am + bn) + ab. Since the first two factors are multiplied by 9, their sums will end up being 9 or 0, leaving us with 'ab'. In our example, 'a' was 7 and 'b' was 5. We would expect that in any base system, the number before that base would behave just like the nine.

Limitation to casting out nines

While extremely useful, casting out nines does not catch all errors made while doing calculations. For example, the casting-out-nines method would not recognize the error in a calculation of 5 × 7 which produced any of the erroneous results 8, 17, 26, etc. (that is, any result congruent to 8 modulo 9). In particular, casting out nines does not catch transposition errors, such as 1324 instead of 1234. In other words, the method only catches erroneous results whose digital root is one of the 8 digits that is different from that of the correct result.

History

A form of casting out nines known to ancient Greek mathematicians was described by the Roman bishop Hippolytus (170–235) in '' The Refutation of all Heresies'', and more briefly by the Syrian Neoplatonist philosopher Iamblichus (c.245–c.325) in his commentary on the ''Introduction to Arithmetic'' of Nicomachus of Gerasa. Both Hippolytus's and Iamblichus's descriptions, though, were limited to an explanation of how repeated digital sums of Greek numerals were used to compute a unique "root" between 1 and 9. Neither of them displayed any awareness of how the procedure could be used to check the results of arithmetical computations.

The earliest known surviving work which describes how casting out nines can be used to check the results of arithmetical computations is the ''Mahâsiddhânta'', written around 950 by the Indian mathematician and astronomer Aryabhata II (c.920–c.1000).
Writing about 1020, the Persian polymath, Ibn Sina (Avicenna) (c.980–1037), also gave full details of what he called the "Hindu method" of checking arithmetical calculations by casting out nines.

The procedure was described by Fibonacci in his ''Liber Abaci''.

Generalization

This method can be generalized to determine the remainders of division by certain prime numbers.

Since 3·3 = 9,
: $n \bmod 3 = ( n \bmod 9 ) \bmod 3.$
So we can use the remainder from casting out nines to get the remainder of division by three.

Casting out ninety nines is done by adding groups of two digits instead just one digit.

Since 11·9 = 99,
: $n \bmod 11 = ( n \bmod 99 ) \bmod 11.$
So we can use the remainder from casting out ninety nines to get the remainder of division by eleven. This is called casting out elevens. The same result can also be calculated directly by alternately adding and subtracting the digits that make up $n$. Eleven divides $n$ if and only if eleven divides that sum.

Casting out nine hundred ninety nines is done by adding groups of three digits.

Since 37·27 = 999,
: $n \bmod 37 = ( n \bmod 999 ) \bmod 37.$
So we can use the remainder from casting out nine hundred ninety nines to get the remainder of division by thirty seven.

Notes

References

*
*
*
*
*
*
*

External links

*
"Numerology"
by R. Buckminster Fuller

by Paul Niquette
*

{{DEFAULTSORT:Casting Out Nines
Arithmetic
Error detection and correction