A = Number of 1s = 81 1 1 1 … 1 1 1
What is the remainder when A is divided by 81?
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.
Since you know that the answer is 0, it's actually simpler to prove that 1 0 8 1 − 1 is divisible by 729 (which is equivalent to proving that A is divisible by 7 2 9 / 9 = 8 1 ).
Just use binomial expansion:
1 0 8 1 − 1 = ( 9 + 1 ) 8 1 − 1 = 9 3 ( ⋯ ) + ( last few terms )
What's left to do is to prove that the last few terms is divisible by 729 too.
81 can be written as 3^4. So 'A' should be divisible by 3.Since there are all one's therefore sum of all digits =81 which is divisible by 3.Since 'A' satisfies the divisiblity criteria of 3,hence the remainder is 0
Problem Loading...
Note Loading...
Set Loading...
Let a = # of 1s = 9 1 1 1 1 1 1 1 1 1 . Then A = a ( 1 + 1 0 9 + 1 0 1 8 + 1 0 2 7 + … + 1 0 7 2 ) . Note that the sum of digit of a is 9; a is divisible by 9. And that the sum of digit of 1 + 1 0 9 + 1 0 1 8 + 1 0 2 7 + … + 1 0 7 2 is also 9 and it is divisible by 9. Therefore A is divisible by 81 and the remainder is 0 .