n → ∞ lim n 2 0 1 5 1 k = 1 ∑ n ( k + 2 0 1 5 ) 2 0 1 4
The previous limit is equal to a number of the form b a where a and b are two coprime natural numbers. Find a + 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.
Essentially what you are doing is simply method of differences, and calculating what the leading coefficient is.
This is very nice, Pi Han Goh!
How we have A(n+1) - A(n )..... why we have not subtracted A(n)
Notice that n s 1 ∑ k = 1 n k s − 1 = ∑ k = 1 n ( n k ) s − 1 n 1 is the right Riemann sum of the function f ( x ) = x s − 1 over the interval [ 0 , 1 ] that corresponds to the partition { 0 , n 1 , n 2 , . . . n n } . Therefore n → ∞ lim n s 1 k = 1 ∑ n k s − 1 = ∫ 0 1 x s − 1 d x = s 1 ( 1 )
On the other hand, if s > r + 1 then n → ∞ lim n s 1 k = 1 ∑ n k r = n → ∞ lim n s − r − 1 1 n r + 1 1 k = 1 ∑ n k r = n → ∞ lim n s − r − 1 1 ∗ ∫ 0 1 x r d x = 0 ∗ r + 1 1 = 0 ( 2 )
Now using (1) and (2) we get n → ∞ lim n 2 0 1 5 1 k = 1 ∑ n ( k + 2 0 1 5 ) 2 0 1 4 = i = 0 ∑ 2 0 1 4 ( ( i 2 0 1 4 ) ∗ 2 0 1 5 i ∗ n → ∞ lim n 2 0 1 5 1 k = 1 ∑ n k 2 0 1 4 − i ) = 2 0 1 5 1 .
Therefore, the answer for this question is 1 + 2 0 1 5 = 2 0 1 6 .
Yes same approach here
Another interesting problem!
Just an outline of a solution: The sum will be a polynomial in n + 2 0 1 5 with leading term 2 0 1 5 ( n + 2 0 1 5 ) 2 0 1 5 , but that is just a polynomial in n with leading term 2 0 1 5 n 2 0 1 5 . After dividing by n 2 0 1 5 we end up with 2 0 1 5 1 plus stuff that goes to 0 as n → ∞ , so that the limit is 2 0 1 5 1 , with a + b = 2 0 1 6 .
An easier way of expressing what you said is to use the Method of Differences .
Log in to reply
Good point! Thanks! I tend to be a bit too informal and brief.
You are right, Otto. This is the idea!
Problem Loading...
Note Loading...
Set Loading...
A direct application of Stolz–Cesàro theorem should do the trick.
Let a n = k = 1 ∑ n ( k + 2 0 1 5 ) 2 0 1 4 and b n = n 2 0 1 5 . Because b n is a strictly monotone and divergent sequence, then Stolz–Cesàro theorem is applicable if n → ∞ lim b n + 1 − b n a n + 1 − a n exist.
So we have a n + 1 − a n = ( n + 2 0 1 6 ) 2 0 1 4 ,
n → ∞ lim b n + 1 − b n a n + 1 − a n = = = n → ∞ lim ( n + 1 ) 2 0 1 5 − n 2 0 1 5 ( n + 2 0 1 6 ) 2 0 1 4 n → ∞ lim 2 0 1 5 n 2 0 1 4 + … n 2 0 1 4 + … 2 0 1 5 1
which is a finite number. Hence n → ∞ lim n 2 0 1 5 1 k = 1 ∑ n ( k + 2 0 1 5 ) 2 0 1 4 = n → ∞ lim b n a n = n → ∞ lim b n + 1 − b n a n + 1 − a n = 2 0 1 5 1 .