Suppose a 3-digit number
is divisible by 3. Prove that
is divisible by 9.
Given that the
is divisible by 3
Now,
the expanded form of ![]()
= 111a + 111b + 111c
= 111(a +b +c)
Since
is divisible by 3
⇒ a +b +c is divisible by 3
Also, 111 (a +b +c) as 1+1+1 = 3 is also divisible by 3
Hence the number
is divisible by 9 as the divisibility test of 9 states the number is divisible by 9 if and only if the sum of the digits is divisible by 9
Couldn't generate an explanation.
Generated by AI. May contain inaccuracies — always verify with your textbook.