Evaluate
n = 0 ∑ ∞ n 4 + n 2 + 1 n .
Note : Refrain from using Wolfram Alpha to solve this problem.
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.
Done this way.For ones who are curious about this method..this is the telescopic method.It's a great way to do trigonometry summation and sequence and series problems!
how to factorize it?
Log in to reply
n 4 + n 2 + 1
= n 4 + 2 n 2 − n 2 + 1
= n 4 + 2 n 2 − ( n 2 − 1 )
= n 4 + 2 n 2 − ( n + 1 ) ( n − 1 )
= n 4 + ( n + 1 ) n 2 − ( n − 1 ) n 2 − ( n + 1 ) ( n − 1 )
= n 2 ( n 2 + n + 1 ) − ( n − 1 ) ( n 2 + n + 1 )
= ( n 2 + n + 1 ) ( n 2 − n + 1 )
Exactly same way.
this is no proof, but:
the first few terms of the sequence are 1/3 , 2/21 , 3/91 , 4/273 ...
if we take the "cumulative sequence" of the sequence above, we get:
1/3 , (1/3 + 2/21) , (1/3 + 2/21 + 3/91), (1/3 + 2/21 + 3/91 + 4/273) ... = 1/3 , 3/7 , 6/13 , 10/21 ...
This sequence is the triangle numbers (formula n(n+1)/2) divided by the sequence n^2+n+1
The formula for this sequence is therefore n(n+1)/2(n^2+n+1) = (n^2+n)/(2n^2+2n+1)
The limit of this function (which is the answer) is 1/2, as this is the ratio between the coefficients of the dominant terms
Problem Loading...
Note Loading...
Set Loading...
n 4 + n 2 + 1 n can be factorized as ( n 2 + n + 1 ) ( n 2 − n + 1 ) n = n 2 − n + 1 1 / 2 − n 2 + n + 1 1 / 2
We assume that a n = n 2 − n + 1 1 / 2
So, a n + 1 = n 2 + n + 1 1 / 2
Hence,
S N = n = 0 ∑ N n 4 + n 2 + 1 n = n = 0 ∑ N ( a n − a n + 1 )
= ( a 0 − a 1 ) + ( a 1 − a 2 ) + . . . . + ( a N − a N + 1 ) = a 0 − a N + 1
= 2 1 − N 2 + N + 1 N
Finally, N → ∞
S ∞ = 2 1