Define the 2015 polynomials
P n ( x ) = ( x − 1 ) ( x − 2 ) . . . ( x − n )
for n = 1 , 2 , . . . , 2 0 1 5 .
Each of these can be written as a polynomial in x − 2 0 1 6 , with a constant term of Q n . For example, Q 1 = 2 0 1 5 because P 1 ( x ) = ( x − 2 0 1 6 ) + 2 0 1 5 .
Find the smallest integer larger than n = 1 ∑ 2 0 1 5 2 0 1 5 ! Q 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.
Set y = x − 2 0 1 6 . Rewrite P n ( x ) in terms of y :
P n ( x ) = ( y + 2 0 1 5 ) ( y + 2 0 1 4 ) … ( y + 2 0 1 6 − n ) = i = 1 ∏ 2 0 1 6 − n ( y + i )
Multiplying out all the i 's gives the constant term Q n = i = 1 ∏ 2 0 1 6 − n i = ( 2 0 1 6 − n ) ! 2 0 1 5 ! .
From this, we know S = n = 1 ∑ 2 0 1 5 2 0 1 5 ! Q n = n = 1 ∑ 2 0 1 5 ( 2 0 1 6 − n ) ! 1 = n = 1 ∑ 2 0 1 5 n ! 1 by noticing certain symmetries in the sum.
It is a well-known fact that 3 > e = n = 1 ∑ ∞ n ! 1 > n = 1 ∑ 2 0 1 5 n ! 1 ; thus, by looking at the first few partial sums and noticing that the infinite series converges moderately quickly, we can conclude
⌈ S ⌉ = 3
Problem Loading...
Note Loading...
Set Loading...
From remainder theorem, we note that Q n is the remainder of P n ( 2 0 1 6 ) . Therefore,
Q n = P n ( 2 0 1 6 ) = ( 2 0 1 6 − 1 ) ( 2 0 1 6 − 2 ) . . . ( 2 0 1 6 − n ) = ( 2 0 1 5 − n ) ! 2 0 1 5 !
Therefore,
n = 1 ∑ 2 0 1 5 2 0 1 5 ! Q n = i = 1 ∑ 2 0 1 5 ( 2 0 1 5 − n ) ! 1 = m = 0 ∑ 2 0 1 4 m ! 1
We know that:
m = 0 ∑ 2 0 1 4 m ! 1 < m = 0 ∑ ∞ m ! 1 = e = 2 . 7 1 8 2 8 1 8 2 8 < 3