Thursday, 23 April 2015

elementary number theory - Proving that 9 is a divisor of xinBbbN if the sum of digits of x is divisible by 9.

Suppose x is a positive integer with n digits, say x=d1d2d3dn. If 9 is a divisor of d1+d2+dn, prove then 9 is a divisor of x.



My attempt: suppose x=4518. Therefore d1=4,d2=5,d3=1,d4=8 those added together equals 18, where 9 is a divisor.



With that in mind 4518 can be written as 4000+500+10+8. How do you show that 9 is a divisor of this entire number from the information given?

No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find limh0sin(ha)h without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...