Show that an integer N is congruent modulo 9 to the sum of its decimal digits. For example,
This is the basis for the familiar procedure of “casting out 9’s” when checking computations in arithmetic.
Sorry the answer is not available at the moment…
If you are able to find the answer, please make sure to post it here. So that your Juniors have smile on their lips and feel happy.
Spread the 'tradition of sharing'.