If n is an integer, then find the biggest value of n such that n + 1 0 n 3 + 1 0 is also an integer.
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.
n + 1 0 n 3 + 1 0 = n + 1 0 n 2 ( n + 1 0 ) − 1 0 n 2 + 1 0 = n + 1 0 n 2 ( n + 1 0 ) − 1 0 n ( n + 1 0 ) + 1 0 0 n + 1 0 = n + 1 0 n 2 ( n + 1 0 ) − 1 0 n ( n + 1 0 ) + 1 0 0 ( n + 1 0 ) − 9 9 0 = n 2 − 1 0 n + 1 0 0 − n + 1 0 9 9 0
For the left-hand side n + 3 n 3 + 1 0 to be an integer, 9 9 0 must be divisible by n + 1 0 and the biggest n that can do that is 9 8 0 .
I think you have a small typo in the last equality (I think you may have forgotten the "100" term. Thx.
To solve this , you have to know one think ...that if A and B both are divisible by P , then both A+B and A-B are also divisible by P . Here I am doing one think if I write k | m then i am meaning that m is divisible by k.
Here,
n+10 | n³+10 ------(1)
Now it is obvious that n+10 | n²(n+10) ----(2) now using (1) and (2) , we can say that n+10 | n²(n+10) -(n³+10)
That means n+10 | 10n²-10 -----(3)..now it is also obvious that n+10 | 10n(n+10) ----(4) now using (3) and (4) we can say that n+10 | 10n(n+10) -(10n²-10) ..that means n+10 | 100n+10 ---(5) now we can write n+10 | 100(n+10)---(6) ..using (5) and (6) n+10| 100(n+10)-(100n+10) ..that means n+10 | 990 ...and now if we want to get the highest value of n, we have to take the biggest factor of 990 which is 990 itself .so n+10 = 990 (where n has it's biggest value ) so the BIGGEST value of n is 980.🙃
Since the numerator is a cubic, n + 1 0 n 3 + 1 0 can be written in the form A n 2 + B n + C + n + 1 0 D where A , B , C , D are integers. This is because when we do polynomial long division, we are using only addition, subtraction and multiplication which are closed in the integers.
Then n 3 + 1 0 = A n 2 ( n + 1 0 ) + B n ( n + 1 0 ) + C ( n + 1 0 ) + D which must hold for all A , B , C , D . When n = − 1 0 , − 9 9 0 = D , and so the reciprocal term is − n + 1 0 9 9 0 . All the other terms are integers because A , B , C , D , n are integers, so − n + 1 0 9 9 0 must also be an integer.
Thus n + 1 0 = 9 9 0 ⇒ n = 9 8 0 .
Problem Loading...
Note Loading...
Set Loading...
We can write the given expression as
n + 1 0 n 3 + 1 0 = n 2 − 1 0 n + 1 0 0 − n + 1 0 9 9 0
Since the expression is an integer, the maximum possible value of n is 9 9 0 − 1 0 or 9 8 0 .