Remember your identities

Find the largest value of integer n n such that 1 0 n 10^n divides 10 1 100 1 101^{100} - 1 .


The answer is 4.

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.

2 solutions

10 1 100 1 = ( 100 + 1 ) 100 1 = n = 0 100 ( 100 n ) 10 0 n 1 = n = 1 100 ( 100 n ) 10 0 n 101^{100} - 1 = (100 + 1)^{100} - 1 = \sum_{n=0}^{100} {100 \choose n} 100^{n} - 1 = \sum_{n=1}^{100} {100 \choose n} 100^{n} \Rightarrow the greatest power of 10 which perfectly divides to 10 1 100 1 101^{100} - 1 is 4 . Look at ( ( 100 1 ) 10 0 1 {100 \choose 1} \cdot 100^{1} and ( 100 2 ) 10 0 2 {100 \choose 2} \cdot 100^{2} )

Your solution does show that 1 0 4 10 1 100 1 10^4\mid 101^{100}-1 but how do you show that 1 0 n ∤ 10 1 100 1 n > 4 10^n\not\mid 101^{100}-1~\forall~n\gt 4 ?

Prasun Biswas - 5 years, 3 months ago

Log in to reply

Because if you sum a 10 0 3 + b 10 0 4 + . . . . + c 10 0 100 which they have at least six 0’s at the end, a \cdot 100^3 + b \cdot 100^4 +.... + c \cdot 100^{100} \text{ which they have at least six 0's at the end, } to ( 100 1 ) 10 0 1 {100 \choose 1} \cdot 100^{1} + ( 100 2 ) 10 0 2 = 49510000 {100 \choose 2} \cdot 100^{2} = 49510000 it won't affect to the last six figures(digits)

Guillermo Templado - 5 years, 3 months ago

Log in to reply

You should include this part in your solution.

Prasun Biswas - 5 years, 3 months ago

Log in to reply

@Prasun Biswas good, it's just included, isn't it?

Guillermo Templado - 5 years, 3 months ago
William Isoroku
Feb 22, 2016

Use binomial theorem

I did it that way too.

Rishik Jain - 5 years, 3 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...