Find the digit such that the five-digit number is divisible by 9.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Solution 1: By the rules of divisibility, n + 8 + 7 + 8 + n must be a multiple of 9 . Thus, 2 n + 2 3 ≡ 0 ( m o d 9 ) , which gives 2 n ≡ − 1 4 ( m o d 9 ) ⇒ n ≡ − 7 ≡ 2 ( m o d 9 ) . Since n is a digit, n = 2 .
Solution 2: We can check that 2 + 8 + 7 + 8 + 2 = 2 7 is a multiple of 9 , hence by the rules of divisibility, 2 7 8 7 2 is a multiple of 9 . It remains to check that no other digit n will work.