(a) Let akak1 . . . a1a0 be the decimal representation of an integer n. Show that n mod
Chapter 9, Problem 8(choose chapter or problem)
(a) Let akak1 . . . a1a0 be the decimal representation of an integer n. Show that n mod 9 = (ak + ak1 + + a1 + a0) mod 9. (b) Use (a) to determine the remainder when 8776 is divided by 9.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer