Show that the number 9 divides the number $ m$ if and only if the sum of the digits of the number $ m $ is divisible by 9.
Prove "casting out nines" of an integer is equivalent to that integer modulo 9