Let { a n } be a sequence defined as a 0 = a 1 = 1 and a n + 2 = 2 a n + 1 + a n − 1 for n ≥ 0 .
Find the value of this infinite summation S = k = 0 ∑ ∞ 3 k a k
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.
A much better and shorter solution than what I had in mind.
Log in to reply
A great problem; it was fun to work it out. I had never done a generating function for a recursion before, except for the Fibonacci sequence.
(+1) Nice! I divided by 3 n and made it into couple of telescopic series.
Could u plz explain me in more simplest and understanding way
Log in to reply
The basic idea is simple: With a sequence { a 0 , a 1 , a 2 , . . . } we often associate its generating function A ( x ) = a 0 + a 1 x + a 2 x 2 + . . . . . Now we can apply calculus and other fun techniques; at the end we substitute the value of x we are interested in, x = 3 1 in our case.
What I do in lines two and three of my solution is just basic algebra: I use the given recursion for a n + 2 and simplify.
See whether this makes sense; feel free to ask further questions.
Log in to reply
Sorry iam not the guy who asked you to explain initially... but could you please explain how you got that 1+x inthe first line of the soln. Also could you explain why you considered the generating function for the sum ( at least that is what i think you did...) and not what has been done below (which is what i did)?
Log in to reply
@Milind Blaze – Why generating functions? Well, it is natural and elegant to consider ∑ a n x n and then specify x = 3 1 at the end ;)
The terms 1 + x in the first line are a 0 + a 1 x , with the values of a 0 and a 1 being given. Starting from a 2 , we can use the given recursion.
Log in to reply
@Otto Bretscher – Oh yeah... i used a1 and a0 differently so i got confused. Why the condition on x though?.... i tried figuring it out but couldn't...Thanks!
Log in to reply
@Milind Blaze – What condition on x ?
Log in to reply
@Otto Bretscher – @Milind Blaze meant the domain of A ( x ) , that is the disc of convergence of A ( x ) . (I think.)
Log in to reply
@A Former Brilliant Member – Oh yes: We are taking the minimum of the moduli of the roots of the denominator
An explicit equation for the sequence will be of the form a n = k + c 1 p 1 n + c 2 p 2 n , where k = 2 k + k − 1 and p 1 , 2 are the solutions of p 2 − 2 p − 1 = 0 .
This gives us k = 2 1 , and p 1 , 2 = 1 ± 2 ; from a 0 = 1 we conclude that c 1 + c 2 = 2 1 ; from a 1 = 1 it follows that c 1 = c 2 = 4 1 . Thus a n = 2 1 + 4 1 ( 1 + 2 ) n + 4 1 ( 1 − 2 ) n . For the infinite sum we note that ∑ k = 0 ∞ x k = 1 / ( 1 − x ) , so that k = 0 ∑ ∞ 3 k 1 / 2 = ( 1 − 1 / 3 ) 1 / 2 = 4 3 ; k = 0 ∑ ∞ 3 k 4 1 ( 1 ± 2 ) k = 1 − ( 3 1 ± 3 1 2 ) 1 / 4 = 4 ⋅ ( 2 ∓ 2 ) 3 = 4 ⋅ 2 3 ( 2 ± 2 ) = 4 3 ± 8 3 2 ; summing these, we find k = 0 ∑ ∞ a n = 4 3 + 4 3 + 8 3 2 + 4 3 − 8 3 2 = 4 9 ≈ 2 . 2 5 .
This is how I solved it. Thank you for posting the solution.
Just a typo, 4 9 = 2 . 2 5 and not ≈
Problem Loading...
Note Loading...
Set Loading...
All sums will be for n = 0 to infinity.
Consider the generating function A ( x ) = ∑ a n x n = 1 + x + ∑ a n + 2 x n + 2 = 1 + x + 2 ∑ a n + 1 x n + 2 + ∑ a n x n + 2 − ∑ x n + 2 = 2 + 2 x + 2 x ( A ( x ) − 1 ) + x 2 A ( x ) − 1 − x 1 . We solve and find A ( x ) = ( 1 − x ) ( 1 − 2 x − x 2 ) 1 − 2 x for ∣ x ∣ < 2 − 1 . For x = 3 1 we have S = A ( 3 1 ) = 2 . 2 5