An elementary check of a multiplication which makes use of the congruence (mod 9). Let decimal numbers be written , , and their product be . Let the sums of the digits of these numbers be , , and . Then , , and . Furthermore , so . So if c and are incongruent (mod 9), the multiplication has been done incorrectly.

For example, . The sum-of-digits of 12345 and 67890 are 15 and 30, respectively, and the product of these is 450. Similarly, the sum-of-digits of 838102050 is 27. And , so the check shows agreement.

Casting out nines is also an addition test, since , and a subtraction test, since . It can also be used as a division test for (i.e., since .

Casting out nines was transmitted to Europe by the Arabs, but was probably an Indian invention and is therefore sometimes also called "the Hindu check." The procedure was described by Fibonacci in his Liber Abaci (Wells 1986, p. 74).

 

9, Casting out Sevens, Digital Root, Divisibility Tests, Rule of Nines