|
|
| Line 1: |
Line 1: |
| '''Casting out nines''' is a [[sanity test]] to ensure that hand computations of sums, differences, products, and quotients of [[integer]]s are correct. By looking at the [[digital root]]s of the inputs and outputs, the casting-out-nines method can help one check arithmetic calculations. The method is so simple that most schoolchildren can apply it without understanding its mathematical underpinnings. | | I'm a 31 years old and work at the college (Religious Studies).<br>In my [http://Www.Dict.cc/?s=spare+time spare time] I teach myself Chinese. I've been there and look forward to [http://www.wikipedia.org/wiki/returning+anytime returning anytime] soon. I love to read, preferably on my ebook reader. I really love to watch Sons of Anarchy and Arrested Development as well as documentaries about nature. I enjoy Association football.<br><br>Also visit my web-site ... [http://ebook-pdfree.blogspot.com/2014/08/the-maze-runner-pdf-maze-runner-book.html The Maze Runner PDF] |
| | |
| ==Examples==
| |
| | |
| The method involves converting each number into its "casting-out-nines" equivalent, and then redoing the arithmetic. The casting-out-nines answer should equal the casting-out-nines version of the original answer. Below are examples for using casting-out-nines to check [[addition]], [[subtraction]], [[multiplication]], and [[Division (mathematics)|division]].
| |
| | |
| ===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. | |
| {|
| |
| |-
| |
| |align="right"| <math>\mathit{3} 2 \mathit{6} 4\, </math>
| |
| |<math>\Rightarrow</math>
| |
| |<math>\mathit{6}\, </math>
| |
| |2 and 4 add up to 6.
| |
| |-
| |
| |align="right"| <math>\mathit{8415}\, </math>
| |
| |<math>\Rightarrow</math>
| |
| |<math>0\, </math>
| |
| |8+1=9 and 4+5=9; there are no digits left.
| |
| |-
| |
| |align="right"| <math>2 \mathit{9} 46\, </math>
| |
| |<math>\Rightarrow</math>
| |
| |<math>\mathit{3}\, </math>
| |
| |2, 4, and 6 make 12; 1 and 2 make 3.
| |
| |-
| |
| |align="right"| <math>\underline{+\mathit{3} 20 \mathit{6}}</math>
| |
| |<math>\Rightarrow</math>
| |
| |<math>2\, </math>
| |
| |2 and 0 are 2.
| |
| |-
| |
| |align="right"| <math>\mathit{1} 7 \mathit{8} 31\, </math>
| |
| |
| |
| |rowspan="2"| <math>\bigg\Downarrow</math>
| |
| |7, 3, and 1 make 11; 1 and 1 add up to 2.
| |
| |-
| |
| |align="center"|<math>\Downarrow</math>
| |
| |-
| |
| |align="center"|<math>{2}\, </math>
| |
| |<math>\Leftrightarrow</math>
| |
| |<math>2\, </math>
| |
| |The excess from the sum should equal the final excess from the addends.
| |
| |}
| |
| | |
| ===Subtraction===
| |
| {|
| |
| |-
| |
| |align="right"| <math>\mathit{5643}\, </math>
| |
| |<math>\Rightarrow</math>
| |
| |<math>0(9)\, </math>
| |
| |First, cross out all 9s and digits that total 9 in both [[minuend]] and [[subtrahend]] (italicized).
| |
| |-
| |
| |align="right"| <math>\underline{-2\mathit{891}}\, </math>
| |
| |<math>\Rightarrow</math>
| |
| |<math>-2\, </math>
| |
| |Add up leftover digits for each value until one digit is reached.
| |
| |-
| |
| |align="right"| <math>\mathit{2} 7 \mathit{52}\, </math>
| |
| |
| |
| |rowspan="2"| <math>\bigg\Downarrow</math>
| |
| |Now follow the same procedure with the difference, coming to a single digit.
| |
| |-
| |
| |align="center"|<math>\Downarrow</math>
| |
| |
| |
| |Because subtracting 2 from zero gives a negative number, borrow a 9 from the minuend.
| |
| |-
| |
| |align="center"|<math>{7}\, </math>
| |
| |<math>\Leftrightarrow</math>
| |
| |<math>7\, </math>
| |
| |The difference between the minuend and the subtrahend excesses should equal the difference excess.
| |
| |}
| |
| | |
| ===Multiplication===
| |
| {|
| |
| |-
| |
| |align="right"| <math>\mathit{5} \mathit{4} 8\, </math>
| |
| |<math>\Rightarrow</math>
| |
| |<math>8\, </math>
| |
| |First, cross out all 9s and digits that total 9 in each [[Multiplication factor|factor]] (italicized).
| |
| |-
| |
| |align="right"| <math>\underline{\times 62 \mathit{9}}\, </math>
| |
| |<math>\Rightarrow</math>
| |
| |<math>8\, </math>
| |
| |Add up leftover digits for each multiplicand until one digit is reached.
| |
| |-
| |
| |align="right"| <math>{\mathit{3} 44 \mathit{69} 2}\, </math>
| |
| |
| |
| |rowspan="2"| <math>\bigg\Downarrow</math>
| |
| |Multiply the two excesses, and then add until one digit is reached.
| |
| |-
| |
| |align="center"|<math>\Downarrow</math>
| |
| |
| |
| |Do the same with the [[Product (mathematics)|product]], crossing out 9s and getting one digit.
| |
| |-
| |
| |align="center"|<math>{1}\, </math>
| |
| |<math>\Leftrightarrow</math>
| |
| |<math>1\, </math><sup>*</sup>
| |
| |The excess from the product should equal the final excess from the factors.
| |
| |}
| |
| | |
| <sup>*</sup>8 times 8 is 64; 6 and 4 are 10; 1 and 0 are 1.
| |
| | |
| ===Division===
| |
| {|
| |
| |-
| |
| |align="center"|<math>\mathit{2754}62\,</math>
| |
| |align="center"|<math>\div</math>
| |
| |align="center"|<math>877\,</math>
| |
| |align="center"|<math>=</math>
| |
| |align="center"|<math>314\,</math>
| |
| |align="center"|<math>r.</math>
| |
| |align="center"|<math>84\,</math>
| |
| |Cross out all 9s and digits that total 9 in the [[divisor]], [[quotient]], and [[remainder]].
| |
| |-
| |
| |align="center"|<math>\Downarrow</math>
| |
| ||
| |
| |align="center"|<math>\Downarrow</math>
| |
| ||
| |
| |align="center"|<math>\Downarrow</math>
| |
| ||
| |
| |align="center"|<math>\Downarrow</math>
| |
| |Add up all uncrossed digits from each value until one digit is reached for each value.
| |
| |-
| |
| |align="center"|<math>8\,</math>
| |
| |align="center"|<math>\Leftrightarrow</math>
| |
| |align="center"|<math>(4\,</math>
| |
| |align="center"|<math>\times</math>
| |
| |align="center"|<math>8)\,</math>
| |
| |align="center"|<math>+</math>
| |
| |align="center"|<math>3\,</math>
| |
| |The dividend excess should equal the final excess from the other values.
| |
| In other words, you are performing the same procedure as in a multiplication, only backwards. 8x4=32 which is 5, 5+3 = 8. And 8=8.
| |
| |}
| |
| | |
| ==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).
| |
| | |
| One should note that the operation does not work on fractions, since a given fractional number does not have a unique representation.
| |
| | |
| == A variation on the explanation ==
| |
| | |
| A nice trick for very young children to learn to add nine is to add ten to the digit and to count back one. Since we are adding 1 to the ten's digit and subtracting one from the unit's 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 positive integer can be written as 9×n + a, where 'a' is a single digit from 0 to 8, and 'n' is any positive 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.
| |
| | |
| == Limitations to Casting out nines ==
| |
| | |
| While extremely useful, casting out nines does not "catch" all errors made while doing calculations. For example, 5x7 = 8. By the casting-out-nines method, it would appear that this multiplication is correct, which it is not. This would also happen with the result of 17, 26, et al. In other words there will be an "uncaught" mistake every nine numbers, this would yield a 90% effectiveness to the method.
| |
| | |
| ==History==
| |
| ''Abjectio novenaria '' (Latin for "casting out nines") was known to the Roman bishop [[Hippolytus_of_Rome|Hippolytus]] as early as the third century. Ibn Sina ([[Avicenna]]) (908–946) was a Persian physician, astronomer, physicist and mathematician who contributed to the development of this mathematical technique.<ref>{{Harvtxt|Masood|2006|pp=104 f}}</ref> It was employed by twelfth-century Hindu mathematicians.<ref>{{Harvtxt|Cajori|1991|p=91}}</ref> In the 17th century, [[Gottfried Wilhelm Leibniz]] not only used the method extensively, but presented it frequently as a model for rationality:
| |
| "By means of this, once a reasoning in morality, physics, medicine or metaphysics is reduced to these terms or characters, one will be able to apply to it at any moment a numerical test, so that it will be impossible to be mistaken if one does not so desire...".<ref>{{Harvtxt|Leibniz|2008|p=277}}</ref>
| |
| | |
| In ''[[Synergetics]]'', [[Buckminster Fuller|R. Buckminster Fuller]] claims to have used casting-out-nines "before World War I."<ref>{{Harvtxt|Fuller|1982|p=765}}</ref> Fuller explains how to cast out nines and makes other claims about the resulting 'indigs,' but he fails to note that casting out nines can result in false positives.
| |
| | |
| The method bears striking resemblance to standard [[signal processing]] and computational [[error detection]] and [[error correction]] methods, typically using similar modular arithmetic in [[checksum]]s and simpler [[check digit]]s.
| |
| | |
| ==See also==
| |
| *{{Citation|last=Cajori|first=Florian|author-link=Florian Cajori|year=1991|title=A History of Mathematics (AMS Chelsea Publishing)|publisher=[[American Mathematical Society|AMS]]|location=New York, NY|edition=5th|isbn=0-8218-2102-4|url=http://www.ams.org/bookstore-getitem/item=CHEL-303-H|ref=harv}}
| |
| *{{Citation|author=Dub Trio|author-link=Dub Trio|date=2004-09-14|title=Casting Out The Nines|publisher=ROIR|format=MP3 Music|asin=B000UO68AM|ref=harv}}
| |
| *{{Citation|last=Fuller|first=R. Buckminster|author-link=R. Buckminster Fuller|date=April 1982|title=Synergetics: Explorations in the Geometry of Thinking|publisher=Macmillan Publishing Company|location=New York, NY|edition=New|isbn=0-02-065320-4|ref=harv}}
| |
| *{{Citation|last=Leibniz|first=Gottfried Wilhelm|author-link=Gottfried Wilhelm Leibniz|editor-last=Dascal|editor-first=Marcelo|editor-link=Marcelo Dascal|date=2008-01-24|title=Gottfried Wilhelm Leibniz: The Art of Controversies|publisher=Springer|location=New York, NY|edition=Paperback|series=The New Synthese Historical Library|isbn=978-1-4020-8190-3|ref=harv}}
| |
| *{{Citation|last=Masood|first=Ehsan|author-link=Ehsan Masood|date=2006-01-15|title=Science and Islam: A History|publisher=Icon Books Ltd.|location=Duxford, United Kingdom|isbn=1-84831-081-1|ref=harv}}
| |
| | |
| ==References==
| |
| {{Reflist}}
| |
| | |
| ==External links==
| |
| *{{mathworld|CastingOutNines|title=Casting Out Nines}}
| |
| *[http://www.rwgrayprojects.com/synergetics/s12/p2200.html "Numerology"] by R. Buckminster Fuller
| |
| *[http://niquette.com/puzzles/paranump.html "Paranormal Numbers"] by Paul Niquette
| |
| | |
| {{DEFAULTSORT:Casting Out Nines}}
| |
| [[Category:Arithmetic]]
| |
| [[Category:Error detection and correction]]
| |