Find the greatest integer k for which 1 9 9 1 k divides
1 9 9 0 1 9 9 1 1 9 9 2 + 1 9 9 2 1 9 9 1 1 9 9 0
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.
We have by Lift the exponent lemma:
v 1 9 9 1 ( 1 9 9 0 1 9 9 1 1 9 9 2 + 1 ) = v 1 9 9 1 ( 1 9 9 0 + 1 ) + v 1 9 9 1 ( 1 9 9 1 1 9 9 2 ) = 1 + 1 9 9 2 = 1 9 9 3
v 1 9 9 1 ( 1 9 9 2 1 9 9 1 1 9 9 0 − 1 ) = v 1 9 9 1 ( 1 9 9 2 − 1 ) + v 1 9 9 1 ( 1 9 9 1 1 9 9 0 ) = 1 + 1 9 9 0 = 1 9 9 1 .
Therefore v 1 9 9 1 ( 1 9 9 0 1 9 9 1 1 9 9 2 + 1 9 9 2 1 9 9 1 1 9 9 0 ) = v 1 9 9 1 ( 1 9 9 0 1 9 9 1 1 9 9 2 + 1 + 1 9 9 2 1 9 9 1 1 9 9 0 − 1 ) = m i n ( 1 9 9 1 , 1 9 9 3 ) = 1 9 9 1 .
Problem Loading...
Note Loading...
Set Loading...
Relevant wiki: Binomial Theorem
N = 1 9 9 0 1 9 9 1 1 9 9 2 + 1 9 9 2 1 9 9 1 1 9 9 0 = ( 1 9 9 1 − 1 ) 1 9 9 1 1 9 9 2 + ( 1 9 9 1 + 1 ) 1 9 9 1 1 9 9 0 = k = 0 ∑ 1 9 9 1 1 9 9 2 ( k 1 9 9 1 1 9 9 2 ) ( − 1 ) k 1 9 9 1 ( 1 9 9 1 1 9 9 2 − k ) + k = 0 ∑ 1 9 9 1 1 9 9 0 ( k 1 9 9 1 1 9 9 0 ) 1 9 9 1 ( 1 9 9 1 1 9 9 0 − k ) ( By binomial expansion )
We notice that the powers of 1 9 9 1 in both the sum are decreasing, so to find the maximum value of k for which 1 9 9 1 k divides the above, we take the last two terms of each sum into consideration, let this be S
S = [ ( 1 9 9 1 1 9 9 2 − 1 1 9 9 1 1 9 9 2 ) 1 9 9 1 − 1 ] + [ ( 1 9 9 1 1 9 9 0 − 1 1 9 9 1 1 9 9 0 ) 1 9 9 1 + 1 ] = 1 9 9 1 [ ( 1 9 9 1 1 9 9 2 − 1 1 9 9 1 1 9 9 2 ) + ( 1 9 9 1 1 9 9 0 − 1 1 9 9 1 1 9 9 0 ) ] = 1 9 9 1 ( 1 9 9 1 1 9 9 2 + 1 9 9 1 1 9 9 0 ) = 1 9 9 1 1 9 9 3 + 1 9 9 1 1 9 9 1
Thus the smallest term in N is 1 9 9 1 1 9 9 1 which is divisible for k max = 1 9 9 1 , i.e. by 1 9 9 1 1 9 9 1 .