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

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.

Step by Step Solution

3.36 Rating (152 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

We have 1 equiv 1bmod 9 10 equiv 1bmod 9 102 equ... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Cryptography And Network Security Questions!