Let f ( x ) be a polynomial with integer coefficients such that
f ( 2 ) = f ( 0 ) = f ( 1 ) = f ( 5 ) = n f ( − 2 ) = f ( − 1 ) = f ( − 5 ) = − n
for some positive integer n . Find the smallest possible value of n .
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.
(As pointed out by Kishore, "An easier way is to invoke a − b ∣ f ( a ) − f ( b ) " is not immediately applicable.)
Note that for completeness, you have to show that such an integer polynomial exists. That is not immediately obvious.
Log in to reply
Thanks. I'll do that.
Log in to reply
Hey Steven, did you just delete your question "beat your friend at subtraction" ?
Also Congrats on 150 Followers :)
Log in to reply
@A Former Brilliant Member – Thanks! :)
As for the problem, I have reposted it. I thought that the answer was incorrect at first, but then I realized it was ok. I have also edited the wording of the problem to make it clearer.
Log in to reply
@Steven Yuan – Ok,I'll attempt the new question :)
Then you get certain numbers, that divides 2 n . But taking L . C . M won't help. You should get 6 3 0 0 , but taking L . C . M does not give that 9 ∣ n and 2 5 ∣ n . Please reply.
Log in to reply
Hm, that's right. We need the full force of Remainder Factor Theorem.
Log in to reply
@Calvin Lin – Remainder Factor Theorem? Can you explain... Instead if you use Lagrange Interpolation to get a 6th degree polynomial, you get the answer directly.
More or less the same method .Nice solution
@Nikhil George , try this question! I challenge!
I think this is a partway application or proof of Lagrange Interpolation.
Problem Loading...
Note Loading...
Set Loading...
Let g ( x ) = f ( x ) − n . Some of the roots of g ( x ) occur when f ( x ) = n i.e. at x = 2 , 0 , 1 , 5 . Thus, g ( x ) can be factored as x ( x − 1 ) ( x − 2 ) ( x − 5 ) h ( x ) for some polynomial h ( x ) . If we plug in − 2 , − 1 , − 5 into f ( x ) − n , we get
f ( − 2 ) − n f ( − 1 ) − n f ( − 5 ) − n = g ( − 2 ) = ( − 2 ) ( − 3 ) ( − 4 ) ( − 7 ) h ( − 2 ) = ( 2 3 × 3 × 7 ) h ( − 2 ) = − 2 n = g ( − 1 ) = ( − 1 ) ( − 2 ) ( − 3 ) ( − 6 ) h ( − 1 ) = ( 2 2 × 3 2 ) h ( − 1 ) = − 2 n = g ( − 5 ) = ( − 5 ) ( − 6 ) ( − 7 ) ( − 1 0 ) h ( − 5 ) = ( 2 2 × 3 × 5 2 × 7 ) h ( − 5 ) = − 2 n
Thus, − n = ( 2 2 × 3 × 7 ) h ( − 2 ) = ( 2 × 3 2 ) h ( − 1 ) = ( 2 × 3 × 5 2 × 7 ) h ( − 5 ) . The smallest value of n that satisfies this is the least common multiple of 2 2 × 3 × 7 , 2 × 3 2 , and 2 × 3 × 5 2 × 7 . This is 2 2 × 3 2 × 5 2 × 7 = 6 3 0 0 .
For the sake of completeness, we show that a polynomial f ( x ) with our value of n does exist. Plugging into our last equation, we get h ( − 2 ) = − 7 5 , h ( − 1 ) = − 3 5 0 , and h ( − 5 ) = − 6 . Using Lagrange, we get h ( x ) = − 6 3 x 2 − 4 6 4 x − 7 5 1 . Thus,
f ( x ) − 6 3 0 0 = x ( x − 1 ) ( x − 2 ) ( x − 5 ) h ( x ) = x ( x − 1 ) ( x − 2 ) ( x − 5 ) ( − 6 3 x 2 − 4 6 4 x − 7 5 1 ) = − 6 3 x 6 + 4 0 x 5 + 1 8 9 0 x 4 − 1 2 5 0 x 3 − 8 1 2 7 x 2 + 7 5 1 0 x ,
or f ( x ) = − 6 3 x 6 + 4 0 x 5 + 1 8 9 0 x 4 − 1 2 5 0 x 3 − 8 1 2 7 x 2 + 7 5 1 0 x + 6 3 0 0 .