Show that an integer (N) is congruent modulo 9 to the sum of its decimal digits. For
Question:
Show that an integer \(N\) is congruent modulo 9 to the sum of its decimal digits. For example, \(475 \equiv 4+7+5 \equiv 16 \equiv 1+6 \equiv 7(\bmod 9)\). This is the basis for the familiar procedure of "casting out 9's" when checking computations in arithmetic.
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Question Posted: