Let p ( x ) be a polynomial of 2 0 1 5 th degree. We know that for every integer k with 2 ≤ k ≤ 2 0 1 7 : p ( k ) = k 2 − 1 k .
Find the value of p ( 2 0 1 8 ) . If this value can be expressed as b a , where a and b are coprime positive integers, submit your answer as b .
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.
Relevant wiki: Polynomial Interpolation - Remainder Factor Theorem - Intermediate
Let q ( x ) be a polynomial such that q ( x ) = p ( x ) ( x 2 − 1 ) − x . The polynomial q ( x ) has degree d e g ( p ( x ) ) + 2 = 2 0 1 4 + 2 = 2 0 1 6 (in fact p ( x ) is multiplied by x 2 , so the degree is increased of 2).
Therefore we know exactly what q ( x ) is. It is a polynomial of 2 0 1 6 th degree, so it has got at most 2016 roots. Since we have defined q ( x ) as q ( x ) = p ( x ) ( x 2 − 1 ) − x , for every k with 2 ≤ k ≤ 2 0 1 7 , q ( k ) = 0 . i.e. q ( 2 3 0 ) = p ( 2 3 0 ) ( 2 3 0 2 − 1 ) − 2 3 0 → q ( 2 3 0 ) = 2 3 0 2 − 1 2 3 0 ⋅ ( 2 3 0 2 − 1 ) − 2 3 0 = 2 3 0 − 2 3 0 = 0 .
We know exactly all the possible roots of q ( x ) as we have found 2016 of them and they can be at most 2016. Thus,
q ( x ) = ( x − 2 ) ( x − 3 ) … ( x − 2 0 1 6 ) ( x − 2 0 1 7 )
Then,
q ( 2 0 1 8 ) = ( 2 0 1 8 − 2 ) ( 2 0 1 8 − 3 ) … ( 2 0 1 8 − 2 0 1 6 ) ( 2 0 1 8 − 2 0 1 7 ) = 2 0 1 6 !
Since the relation q ( x ) = p ( x ) ( x 2 − 1 ) − x
q ( 2 0 1 8 ) = p ( 2 0 1 8 ) ( 2 0 1 8 2 − 1 ) − 2 0 1 8 → p ( 2 0 1 8 ) = 2 0 1 7 ⋅ 2 0 1 9 2 0 1 6 ! + 2 0 1 8
Now we need to find b from the fraction 2 0 1 7 ⋅ 2 0 1 9 2 0 1 6 ! + 2 0 1 8 . Rewrite it as:
2 0 1 7 ⋅ 2 0 1 9 2 0 1 6 ! + 1 + 2 0 1 7
From Wilson's theorem , ( p − 1 ) ! ≡ − 1 ( m o d p ) . Whereas 2017 is a prime number,
2 0 1 6 ! ≡ − 1 ( m o d 2 0 1 7 ) → 2 0 1 6 ! + 1 ≡ 0 ( m o d 2 0 1 7 ) .
Therefore, 2 0 1 7 ∣ 2 0 1 6 ! + 1 → 2 0 1 7 ∣ 2 0 1 6 ! + 1 + 2 0 1 7 . Now we have to verify if 2019 is the minimum denominator. The factorization of 2 0 1 9 is 3 ⋅ 6 7 3 , so we have to check if 3 ∣ 2 0 1 7 2 0 1 6 ! + 2 0 1 8 or 6 7 3 ∣ 2 0 1 7 2 0 1 6 ! + 2 0 1 8
Since ( 3 , 2 0 1 7 ) = 1 , 3 ∣ 2 0 1 7 2 0 1 6 ! + 2 0 1 8 ⟺ 3 ∣ 2 0 1 6 ! + 2 0 1 8 . That's impossible because 2016! is divisible by 3, but 2018 is not divisible.
Since ( 6 7 3 , 2 0 1 7 ) = 1 , 6 7 3 ∣ 2 0 1 7 2 0 1 6 ! + 2 0 1 8 ⟺ 6 7 3 ∣ 2 0 1 6 ! + 2 0 1 8 . That's also impossible as 2016! contains a 673 factor (so is divisible by 673), but 2018 is not divisible by 673.
So p ( 2 0 1 8 ) = 2 0 1 9 a with a = 2 0 1 7 2 0 1 6 ! + 2 0 1 8 and b = 2 0 1 9
It should have been mentioned that p(x) is monic polynomial.Though i assumed it while solving still it must be mentioned
Log in to reply
Hey the function p(x) need not be a monic function . In fact it is not a monic function. Check my solution here https://imagebin.ca/v/3JPmdDgCSnrv
Filippo, as pointed out in the reports, no such polynomial exists. This is because we require q ( x ) + x = 0 for x = 1 , − 1 , which is not possible when q ( x ) = A ( x − 2 ) ( x − 3 ) … ( x − 2 0 1 7 ) .
Is it possible to salvage your problem? Otherwise, I would have to delete it as no answer exists.
Problem Loading...
Note Loading...
Set Loading...
The polynomial q ( x ) = ( x 2 − 1 ) p ( x ) − x has degree 2 0 1 7 and is such that q ( k ) = 0 for 2 ≤ k ≤ 2 0 1 7 . We know 2 0 1 6 distinct roots of q ( x ) , and hence q ( x ) = ( a + b x ) ( x − 2 ) ( x − 3 ) ( x − 4 ) ⋯ ( x − 2 0 1 7 ) for some constants a , b . Since − 1 = q ( 1 ) 2 = 2 q ( − 1 ) = ( a + b ) × 2 0 1 6 ! = ( a − b ) × 2 0 1 8 ! we deduce that 2 0 1 6 ! a = − 2 0 3 5 1 5 3 1 0 1 7 5 7 6 2 0 1 6 ! b = − 2 0 3 5 1 5 3 1 0 1 7 5 7 7 Thus 2 0 1 7 × 2 0 1 9 p ( 2 0 1 8 ) − 2 0 1 8 = q ( 2 0 1 8 ) = 2 0 1 6 ! ( a + 2 0 1 8 b ) and so p ( 2 0 1 8 ) = 2 0 3 5 1 5 3 5 0 4 making the answer 2 0 3 5 1 5 3 .