Find the largest integer value of n such that n + 1 0 divides n 3 + 1 0 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.
Yes , this is the easiest method :)
Exactly Same Way.
( n + 1 0 ) 3 = n 3 + 1 0 0 0 + 3 0 n ( n + 1 0 )
If n 3 + 1 0 0 is divisible by n + 1 0
Then n + 1 0 must divide n 3 + 1 0 0 0 + 3 0 n ( n + 1 0 ) − ( n 3 + 1 0 0 ) = 3 0 n ( n + 1 0 ) + 9 0 0
So n + 1 0 must divide 9 0 0
Hence the largest value of n is 9 0 0 − 1 0 = 8 9 0
By polynomial division,
n + 1 0 n 3 + 1 0 0 = n 2 − 1 0 n + 1 0 0 + n + 1 0 − 9 0 0
where n + 1 0 − 9 0 0 is the remainder. Since we want to find the largest n , value of denominator must be maximized, while keeping the remainder 0.
Largest number which completely divides -900 is ∣ − 9 0 0 ∣ = 9 0 0 .
Therefore,
n + 1 0 = 9 0 0 n = 8 9 0
Simple standard approach of solving such divisibility questions.
Problem Loading...
Note Loading...
Set Loading...
By long division, n 3 + 1 0 0 = ( n 2 − 1 0 n + 1 0 0 ) ( n + 1 0 ) − 9 0 0 so n + 1 0 must divide 900...highest n is n = 8 9 0