[Math] How to avoid arithmetic mistakes

arithmetic

When dealing with several numbers and long equations, it's common to make careless arithmetic mistakes that give the wrong answer. I was wondering if anyone had tips to catch these mistakes, or even better avoid them more often. (aside from the obvious checking your work- that's a must)

Best Answer

There are certain quick methods called sanity checks which will catch most (but not all) arithmetic errors. One common one is to replace each number with the sum of its digits, which is the "casting out nines" method mentioned in Robert Israel's answer. To check a computation, say $567\times 894=506,898$, we replace $567$ with $5+6+7=18$ and $894$ with $8+9+4=21$, and then replace each of these with the sum of their digits to get $9$ and $3$ (in general we keep doing this until we get down to $1$ digit), while on the other side we get $5+0+6+8+9+8=36$ and then $3+6=9$. We then check that $9\times 3=9$ after casting out nines on both sides, and so our answer is probably right (though not necessarily). This method is called "casting out nines" because it ensures that whatever answer you are checking differs from the actual answer by a multiple of nine (hopefully $0\times 9$).

However, this method has a serious drawback: if the answer you are checking is correct except for having the digits switched around (a relatively common error) the method will not catch the error. A remedy for this is to use "casting out elevens" where you take the alternating sums of the digits instead of the sums, such that the last digit is always added rather than subtracted. In our previous example, this becomes $5-6+7=6$, $8-9+4=3$ and $5+0-6+8-9+8=-4$. Here we have to be a little careful: we want to take the equation $6\times 3-(-4)=0$, cast out elevens (take the alternating sum) and verify that the the resulting equation holds, which in this case it does. We move everything to one side so that we don't have to work with numbers of different signs ($6\times 3=-4$ is true $\bmod 11$, which is what matters, but it is not obvious how to cast out elevens to show this). This ensures that whatever answer you are checking differs from the actual answer by a multiple of eleven (hopefully $0\times 11$), hence the name.

Edit: These methods can both be made rigrous with modular arithmetic. The first simple checks that an equation holds $\bmod 9$, and adding the digits comes from the fact that $$\begin{eqnarray} d_n\cdots d_1d_0 &=& \sum\limits_{i=1}^n 10^id_i\\ &\equiv& \sum\limits_{i=1}^n 1^id_i (\bmod 9)\\ &=&\sum\limits_{i=1}^n d_i \end{eqnarray}$$ while the second checks that an equation holds $\bmod 11$, and the alternating sum of the digits comes from the fact that $$\begin{eqnarray} d_n\cdots d_1d_0 &=& \sum\limits_{i=1}^n 10^id_i\\ &\equiv& \sum\limits_{i=1}^n (-1)^id_i (\bmod 11) \end{eqnarray}$$

Credit where credit is due: I believe I read about this years ago in a question to Dr. Math from an elementary school teacher who had been teaching the method and wanted to know how it worked.