Question: 3.1.8 (a) Let n be a positive integer. Prove that n is congruent to the sum of its digits modulo 9. Hintrst consider an example

3.1.8 (a) Let n be a positive integer. Prove that n is congruent to the sum of its digits modulo 9. Hintrst consider an example such as 345 = 3 - 102 + 4 - 10 + 5 . . . (b) Is the integer 123456789 divisible by 9
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
