A polynomial P of degree 2015 satisfies the equation P ( n ) = n 2 1 for n = 1 , 2 , . . . , 2 0 1 6 . Find ⌊ 2 0 1 7 P ( 2 0 1 7 ) ⌋ .
Notation: ⌊ ⋅ ⌋ denotes the floor function .
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.
Same solution....but can i proceed with lagrange interpolation??
Log in to reply
Well, Lagrange interpolation would give the polynomial as you have 2016 points for a 2015 degree polynomial, but I am not sure how you could get to the problem's solution without an inhuman amount of computation.
Log in to reply
Yeah ok...got it...then it is better to avoid that...thanks.
Hi,Leonel Castillo. I have done the ' inhuman amount of computation ' in my solution.Ah,I'm really exhausted when I finish typing. Of course ,I prefer your solution...
Is there a way to approximate H_2016 without a calculator?
Log in to reply
Not really, unless you have a log table. H_2016 is approximately equal to log(2016) + 0.577 so that is how you would quickly compute it with a basic calculator. Beyond that, no idea.
Log in to reply
Oh that's interesting, why is it approximately ln + 0.577 (I think you mean ln(2016) not log)?
Log in to reply
@Alexander Xue – Well, it is a theorem that the limit as n goes to infinity of H n - ln(n) is exactly the Euler-Masceroni constant, of which I just memorized the digits 0.577. That is why you can approximate H n = ln(n) + 0.577. This is especially true for really big n (like 2016) because the error term for this approximation is approximately 1/n, so you will find in analytic number theory textbooks that H_n = log(n) + 0.577... + O(1/n).
My solution (using Lagrange Interpolation) :
Lemma: For any positive integer n,we have k = 1 ∑ n k 1 = k = 1 ∑ n ( ( − 1 ) k − 1 ( k n ) ⋅ k 1 )
Proof of lemma by induction
Case n=1 is obvious.
Assume that the statement is true for n=k, i.e. i = 1 ∑ k i 1 = i = 1 ∑ k ( ( − 1 ) i − 1 ( i k ) ⋅ i 1 ) .
When n = k + 1 ,use the assumption to get
i = 1 ∑ k + 1 i 1 = i = 1 ∑ k ( ( − 1 ) i − 1 ( i k ) ⋅ i 1 ) + k + 1 1
= i = 1 ∑ k ( ( − 1 ) i − 1 ( ( i k + 1 ) − ( i − 1 k ) ) ⋅ i 1 ) + k + 1 1
= i = 1 ∑ k + 1 ( ( − 1 ) i − 1 ( i k + 1 ) ⋅ i 1 ) − i = 1 ∑ k ( ( − 1 ) i − 1 ( i − 1 k ) ⋅ i 1 ) + k + 1 1 − ( − 1 ) k .
Now we only need to show that i = 1 ∑ k ( ( − 1 ) i − 1 ( i − 1 k ) ⋅ i 1 ) = k + 1 1 − ( − 1 ) k .
Apply the identity ( i k + 1 ) = i k + 1 ( i − 1 k ) to get
i = 1 ∑ k ( ( − 1 ) i − 1 ( i − 1 k ) ⋅ i 1 ) = i = 1 ∑ k ( ( − 1 ) i − 1 ( i k + 1 ) ⋅ k + 1 1 )
= k + 1 − i = 0 ∑ k + 1 ( i k + 1 ) ( − 1 ) i − ( − 1 ) k + 1 ( Using Binomial Theorem )
= k + 1 1 − ( − 1 ) k . □
Come back. By Lagrange Interpolation,
P ( x ) = 1 2 1 ⋅ ( 1 − 2 ) ( 1 − 3 ) ⋯ ( 1 − 2 0 1 6 ) ( x − 2 ) ( x − 3 ) ⋯ ( x − 2 0 1 6 ) + 2 2 1 ⋅ ( 2 − 1 ) ( 2 − 3 ) ⋯ ( 2 − 2 0 1 6 ) ( x − 1 ) ( x − 3 ) ⋯ ( x − 2 0 1 6 ) + ⋯ + 2 0 1 6 2 1 ⋅ ( 2 0 1 6 − 1 ) ( 2 0 1 6 − 2 ) ⋯ ( 2 0 1 6 − 2 0 1 5 ) ( x − 1 ) ( x − 2 ) ⋯ ( x − 2 0 1 5 ) .
Thus,
2 0 1 7 P ( 2 0 1 7 ) = 1 2 1 ⋅ ( − 1 ) 2 0 1 5 ⋅ 0 ! ⋅ 2 0 1 5 ! 2 0 1 7 ! ÷ 2 0 1 6 + 2 2 1 ⋅ ( − 1 ) 2 0 1 4 ⋅ 1 ! ⋅ 2 0 1 4 ! 2 0 1 7 ! ÷ 2 0 1 5 + 3 2 1 ⋅ ( − 1 ) 2 0 1 3 ⋅ 2 ! ⋅ 2 0 1 3 ! 2 0 1 7 ! ÷ 2 0 1 4 + ⋯ + 2 0 1 6 2 1 ⋅ ( − 1 ) 0 ⋅ 2 0 1 5 ! ⋅ 0 ! 2 0 1 7 ! ÷ 1
= 1 1 ⋅ ( − 1 ) 2 0 1 5 ⋅ 1 ! ⋅ 2 0 1 6 ! 2 0 1 7 ! + 2 1 ⋅ ( − 1 ) 2 0 1 4 ⋅ 2 ! ⋅ 2 0 1 5 ! 2 0 1 7 ! + 3 1 ⋅ ( − 1 ) 2 0 1 3 ⋅ 3 ! ⋅ 2 0 1 4 ! 2 0 1 7 ! + ⋯ + 2 0 1 6 1 ⋅ ( − 1 ) 0 ⋅ 2 0 1 6 ! ⋅ 1 ! 2 0 1 7 !
= k = 1 ∑ 2 0 1 6 ( ( − 1 ) k ( k 2 0 1 7 ) ⋅ k 1 )
= 2 0 1 7 1 − k = 1 ∑ 2 0 1 7 ( ( − 1 ) k − 1 ( k 2 0 1 7 ) ⋅ k 1 )
= 2 0 1 7 1 − k = 1 ∑ 2 0 1 7 k 1 ( Using the Lemma. )
= − k = 1 ∑ 2 0 1 6 k 1 ≈ − 8 . 1 8 6 3 3 4 2 8 9 ,so the answer is − 9 . ■
@Haosen Chen , I Am not very good at langrange interpolation polynomial. Can you help me to understand it?
Hi,Priyanshu Mishra.
Since P(x) is a polynomial of degree 2015 ,and 2016 distinct points on the graph of y=P(x) are given, P(x) is uniquely determined.
To figure out what P(x) exactly is, you can use Lagrange Interpolation.After that you'll get a long algebraic expression of P(2017) and enjoy the 'compution'.
see here :
1.https://brilliant.org/wiki/lagrange-interpolation/
2.http://mathworld.wolfram.com/LagrangeInterpolatingPolynomial.html
Problem Loading...
Note Loading...
Set Loading...
Let's consider the polynomial x 2 P ( x ) − 1 . For all x = 1 , 2 , . . . , 2 0 1 6 this polynomial evaluates to zero. Therefore we have 2016 roots and because this polynomial is of degree 2017 we may write: x 2 P ( x ) − 1 = ( x − 1 ) ( x − 2 ) . . . ( x − 2 0 1 6 ) ( a x + b ) . I will solve this problem by finding what a and b are. Let's start with b . Evaluate both sides for x = 0 to obtain − 1 = ( 2 0 1 6 ) ! b so b = 2 0 1 6 ! − 1 .
To find what a is, notice that the polynomial we are studying has an interesting property: It has no x term. This is because the polynomial x 2 P ( x ) has only terms of degree larger than 1. But on the right-hand side, we can spot what the x term coefficient is. First, let's compute the x and constant term of the polynomial ( x − 1 ) ( x − 2 ) . . . ( x − 2 0 1 6 ) . The constant term will be just the product of all those constants, 2 0 1 6 ! . but for the x term we have to do a little work:
The easiest way of conveying this is that if we say that c n is the x term's coefficient of the polynomial ( x − 1 ) . . . ( x − n ) then we have the recurrence relation c 1 = 1 , c n = ( − 1 ) n + 1 ( n ∣ a n − 1 ∣ + ( n − 1 ) ! ) and the solution to this recurrence relation is c n = ( − 1 ) n + 1 n ! H n . (This may be discovered through more elementary but longer calculations). Therefore the coefficient of the x term is − 2 0 1 6 ! H 2 0 1 6 .
Therefore the x term of the entire polynomial ( x − 1 ) . . . ( x − 2 0 1 6 ) ( a x + b ) will be 2 0 1 6 ! a − 2 0 1 6 ! H 2 0 1 6 b but we know this coefficient has to be 0 so we have the equation 2 0 1 6 ! a − 2 0 1 6 ! H 2 0 1 6 b = 0 . We already know what b is so solving for a we get a = − 2 0 1 6 ! H 2 0 1 6 .
Now, there are many ways to conclude as we now have an explicit product representation of our polynomial, but the path I initially took was: Evaluate the expression x 2 P ( x ) − 1 = ( x − 1 ) ( x − 2 ) . . . ( x − 2 0 1 6 ) ( a x + b ) for x = 2 0 1 7 to obtain 2 0 1 7 2 P ( 2 0 1 7 ) − 1 = 2 0 1 6 ! ( 2 0 1 7 a − 2 0 1 6 ! 1 ) . We can reduce this to simply 2 0 1 7 P ( 2 0 1 7 ) = 2 0 1 6 ! a = − H 2 0 1 6 .
Now, use any method you know for approximating the Harmonic numbers to get a good enough approximation, 8 . 1 8 is actually enough and the floor of − 8 . 1 8 is − 9 .