f ( 1 5 ) f ( 1 6 ) f ( 1 7 ) f ( 1 8 ) f ( 1 9 ) = = = = = 1 2 5 1 5 0 2 1 0 2 7 5 3 6 5
Let f ( x ) denote the a 5 th degree polynomial with leading coefficient 3 such that it satisfies all the equations above. Find the value of f ( 2 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.
did same.....
Log in to reply
Did not same.
Log in to reply
computer science?
Log in to reply
@Dev Sharma – Not really. Just like answering the question you set last time. Not a better way to this question but it is an alternative. I can have an immediate check to know that I obtained correct coefficients and then I can apply the coefficients to calculate wanted answer with confidence of correctness. Nevertheless, mentioning 5th degree and 1 coefficient with only 5 known points on the graph is necessary.
We can use Lagrangian interpolation . There is a unique polynomial of degree n − 1 passing through n specific points (there are n conditions to be satisfied by the n coefficients). Lagrangian interpolation gives us a quick method of determining that polynomial.
Define p 1 5 ( x ) p 1 6 ( x ) p 1 7 ( x ) p 1 8 ( x ) p 1 9 ( x ) = = = = = ( x − 1 6 ) ( x − 1 7 ) ( x − 1 8 ) ( x − 1 9 ) ( x − 1 5 ) ( x − 1 7 ) ( x − 1 8 ) ( x − 1 9 ) ( x − 1 5 ) ( x − 1 6 ) ( x − 1 8 ) ( x − 1 9 ) ( x − 1 5 ) ( x − 1 6 ) ( x − 1 7 ) ( x − 1 9 ) ( x − 1 5 ) ( x − 1 6 ) ( x − 1 7 ) ( x − 1 8 ) The whole point of these quartic polynomials is that, for example, p 1 6 ( x ) vanishes at 1 5 , 1 7 , 1 8 , 1 9 , but is nonzero at 1 6 . We can use this property to define g ( x ) = = p 1 5 ( 1 5 ) 1 2 5 p 1 5 ( x ) + p 1 6 ( 1 6 ) 1 5 0 p 1 6 ( x ) + p 1 7 ( 1 7 ) 2 1 0 p 1 7 ( x ) + p 1 8 ( 1 8 ) 2 7 5 p 1 8 ( x ) + p 1 9 ( 1 9 ) 3 6 5 p 1 9 ( x ) 2 4 1 2 5 p 1 5 ( x ) + − 6 1 5 0 p 1 6 ( x ) + 4 2 1 0 p 1 7 ( x ) + − 6 2 7 5 p 1 8 ( x ) + 2 4 3 6 5 p 1 9 ( x ) Then g ( x ) is the unique polynomial of degree 4 taking the values 1 2 5 , 1 5 0 , 2 1 0 , 2 7 5 , 3 6 5 at the points 1 5 , 1 6 , 1 7 , 1 8 , 1 9 , and so the quintic polynomial we want is f ( x ) = 3 ( x − 1 5 ) ( x − 1 6 ) ( x − 1 7 ) ( x − 1 8 ) ( x − 1 9 ) + g ( x ) . Thus f ( 2 0 ) = = = = 3 × 1 2 0 + g ( 2 0 ) 3 6 0 + 2 4 1 2 5 p 1 5 ( 2 0 ) − 2 5 p 1 6 ( 2 0 ) + 2 1 0 5 p 1 7 ( 2 0 ) − 6 2 7 5 p 1 8 ( 2 0 ) + 2 4 3 6 5 p 1 9 ( 2 0 ) 3 6 0 + 2 4 1 2 5 × 2 4 − 2 5 × 3 0 + 2 1 0 5 × 4 0 − 6 2 7 5 × 6 0 + 2 4 3 6 5 × 1 2 0 9 1 0 The merit of this method is that it does not require the values 1 5 , 1 6 , 1 7 , 1 8 , 1 9 to be consecutive; the Method of Differences does.
Wow! This method is awesome. Learnt something new today! Thanks!
Problem Loading...
Note Loading...
Set Loading...
We can use the Method of Differences .
The difference table for the polynomial is given above.
D 1 ( x ) = f ( x + 1 ) − f ( x )
D 2 ( x ) = D 1 ( x + 1 ) − D 1 ( x )
D n ( x ) = D n − 1 ( x + 1 ) − D n − 1 ( x )
We know that for a polynomial of degree n, and leading co-efficient a, D n ( x ) is a constant and is equal to n ! × a .
∴ D 5 ( x ) = 5 ! × 3 = 1 2 0 × 3 = 3 6 0
Using this table f ( 2 0 ) can be computed.
∴ f ( 2 0 ) = 3 6 0 + 5 0 + 2 0 + 2 5 + 9 0 + 3 6 5 = 9 1 0