f ( n ) = ⎩ ⎨ ⎧ 2 0 1 7 n 2 f ( 1 ) + f ( 2 ) + f ( 3 ) + ⋯ + f ( n ) for n = 1 for n > 1
A function f is defined as above for all positive integers n . Find 1 1 n → ∞ lim n 2 f ( n ) + 2 0 1 6 .
For more problems like this, try answering this set .
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.
f ( n ) n 2 f ( n ) ( n + 1 ) 2 f ( n + 1 ) ( n + 1 ) 2 f ( n + 1 ) − n 2 f ( n ) ( n 2 + 2 n + 1 ) f ( n + 1 ) − n 2 f ( n ) n ( n + 2 ) f ( n + 1 ) ⟹ f ( n + 1 ) f ( 2 ) f ( 3 ) f ( 4 ) ⋯ ⟹ f ( n ) = n 2 f ( 1 ) + f ( 2 ) + f ( 3 ) + ⋯ + f ( n ) = k = 1 ∑ n f ( k ) = k = 1 ∑ n + 1 f ( k ) = k = 1 ∑ n + 1 f ( k ) − k = 1 ∑ n f ( k ) = f ( n + 1 ) = n 2 f ( n ) = n + 2 n f ( n ) = 3 1 f ( 1 ) = 4 2 ⋅ 3 1 f ( 1 ) = 5 3 ⋅ 4 2 ⋅ 3 1 f ( 1 ) = ⋯ = k = 1 ∏ n − 1 k + 2 k f ( 1 ) = k = 1 ∏ n − 1 k + 2 2 0 1 7 k = ( n + 1 ) ! 4 0 3 4 ( n − 1 ) ! = n ( n + 1 ) 4 0 3 4 = n 2 + n 4 0 3 4
⟹ n → ∞ lim n 2 f ( n ) ⟹ 1 1 n → ∞ lim n 2 f ( n ) + 2 0 1 6 = n → ∞ lim n 2 + n 4 0 3 4 n 2 = n → ∞ lim 1 + n 1 4 0 3 4 = 4 0 3 4 = 1 1 4 0 3 4 + 2 0 1 6 = 5 5 0
I think, you mean
f ( n ) = k = 1 ∏ n − 1 k + 2 k f ( 1 ) = 4 0 3 4 ( n + 1 ) ! ( n − 1 ) !
in the 12th line.
Log in to reply
Thanks. I have corrected it.
Problem Loading...
Note Loading...
Set Loading...
Relevant wiki: Telescoping Series - Product
First we are going to prove by induction that f ( n ) = n ( n + 1 ) 2 f ( 1 ) . This is obviously clear for n = 1 .
Considering the case n = 2 we obtain
f ( 2 ) = 2 2 f ( 1 ) + f ( 2 )
3 f ( 2 ) = f ( 1 )
f ( 2 ) = 3 f ( 1 ) ,
so our statement is true for n = 2 too. Assuming that the induction hypothesis is proven for all positive integers k < n with n > 2 we have from the definition
( n − 1 ) ( n + 1 ) f ( n ) = ( n 2 − 1 ) f ( n ) = i = 1 ∑ n − 1 f ( i ) = i = 1 ∑ n − 1 i ( i + 1 ) 2 f ( 1 ) = 2 f ( 1 ) i = 1 ∑ n − 1 i ( i + 1 ) 1 = 2 f ( 1 ) i = 1 ∑ n − 1 ( i 1 − i + 1 1 ) = 2 f ( 1 ) ( 1 − n 1 ) = 2 f ( 1 ) n n − 1 ,
since the terms of the telescoping series cancel out. Thus we obtain f ( n ) = 2 f ( 1 ) n ( n − 1 ) ( n + 1 ) n − 1 = n ( n + 1 ) 2 f ( 1 ) hence our induction is complete.
Using this result for n > 1 we get
lim n → ∞ n 2 f ( n ) = lim n → ∞ 2 f ( 1 ) n ( n + 1 ) n 2 = 2 f ( 1 ) lim n → ∞ 1 + n 1 1 = 2 f ( 1 ) = 4 0 3 4 .
Thus ultimately our answer is 1 1 4 0 3 4 + 2 0 1 6 = 5 5 0 .