Sum of a Series

Calculus Level 5

Let { a n } \{ a_n \} be a sequence defined as a 0 = a 1 = 1 a_0 = a_1 = 1 and a n + 2 = 2 a n + 1 + a n 1 a_{n+2} = 2 a_{n+1} + a_n - 1 for n 0 n \ge 0 .

Find the value of this infinite summation S = k = 0 a k 3 k S = \sum_{k=0}^{\infty} \frac{a_k}{3^k}


The answer is 2.25.

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.

2 solutions

Otto Bretscher
Apr 30, 2016

All sums will be for n = 0 n=0 to infinity.

Consider the generating function A ( x ) = a n x n = 1 + x + a n + 2 x n + 2 A(x)=\sum a_nx^n=1+x+\sum 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 1 x =1+x+2\sum a_{n+1}x^{n+2}+\sum a_nx^{n+2}-\sum x^{n+2}=2+2x+2x(A(x)-1)+x^2A(x)-\frac{1}{1-x} . We solve and find A ( x ) = 1 2 x ( 1 x ) ( 1 2 x x 2 ) A(x)=\frac{1-2x}{(1-x)(1-2x-x^2)} for x < 2 1 |x|<\sqrt{2}-1 . For x = 1 3 x=\frac{1}{3} we have S = A ( 1 3 ) = 2.25 S=A\left(\frac{1}{3}\right)=\boxed{2.25}

A much better and shorter solution than what I had in mind.

Hosam Hajjir - 5 years, 1 month ago

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.

Otto Bretscher - 5 years, 1 month ago

(+1) Nice! I divided by 3 n 3^{n} and made it into couple of telescopic series.

Ishan Singh - 5 years, 1 month ago

Could u plz explain me in more simplest and understanding way

Ashrith Appani - 5 years, 1 month ago

Log in to reply

The basic idea is simple: With a sequence { a 0 , a 1 , a 2 , . . . } \{a_0,a_1,a_2,...\} we often associate its generating function A ( x ) = a 0 + a 1 x + a 2 x 2 + . . . . A(x)=a_0+a_1x+a_2x^2+.... . Now we can apply calculus and other fun techniques; at the end we substitute the value of x x we are interested in, x = 1 3 x=\frac{1}{3} 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 a_{n+2} and simplify.

See whether this makes sense; feel free to ask further questions.

Otto Bretscher - 5 years, 1 month ago

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)?

Milind Blaze - 5 years, 1 month ago

Log in to reply

@Milind Blaze Why generating functions? Well, it is natural and elegant to consider a n x n \sum a_nx^n and then specify x = 1 3 x=\frac{1}{3} at the end ;)

The terms 1 + x 1+x in the first line are a 0 + a 1 x a_0+a_1x , with the values of a 0 a_0 and a 1 a_1 being given. Starting from a 2 , a_2, we can use the given recursion.

Otto Bretscher - 5 years, 1 month ago

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!

Milind Blaze - 5 years, 1 month ago

Log in to reply

@Milind Blaze What condition on x x ?

Otto Bretscher - 5 years, 1 month ago

Log in to reply

@Otto Bretscher @Milind Blaze meant the domain of A ( x ) A(x) , that is the disc of convergence of A ( x ) A(x) . (I think.)

A Former Brilliant Member - 5 years, 1 month ago

Log in to reply

@A Former Brilliant Member Oh yes: We are taking the minimum of the moduli of the roots of the denominator

Otto Bretscher - 5 years, 1 month ago

An explicit equation for the sequence will be of the form a n = k + c 1 p 1 n + c 2 p 2 n , a_n = k + c_1p_1^n + c_2p_2^n, where k = 2 k + k 1 k = 2k + k - 1 and p 1 , 2 p_{1,2} are the solutions of p 2 2 p 1 = 0 p^2 - 2p - 1 = 0 .

This gives us k = 1 2 k = \tfrac12 , and p 1 , 2 = 1 ± 2 p_{1,2} = 1\pm\sqrt 2 ; from a 0 = 1 a_0 = 1 we conclude that c 1 + c 2 = 1 2 c_1 + c_2 = \tfrac12 ; from a 1 = 1 a_1 = 1 it follows that c 1 = c 2 = 1 4 c_1 = c_2 = \tfrac14 . Thus a n = 1 2 + 1 4 ( 1 + 2 ) n + 1 4 ( 1 2 ) n . a_n = \tfrac12 + \tfrac14(1 + \sqrt 2)^n + \tfrac14(1 - \sqrt 2)^n. For the infinite sum we note that k = 0 x k = 1 / ( 1 x ) \sum_{k=0}^\infty x^k = 1/(1-x) , so that k = 0 1 / 2 3 k = 1 / 2 ( 1 1 / 3 ) = 3 4 ; k = 0 1 4 ( 1 ± 2 ) k 3 k = 1 / 4 1 ( 1 3 ± 1 3 2 ) = 3 4 ( 2 2 ) = 3 ( 2 ± 2 ) 4 2 = 3 4 ± 3 8 2 ; \sum_{k=0}^\infty \frac{1/2}{3^k} = \frac {1/2}{ (1-1/3)} = \tfrac 34; \\ \sum_{k=0}^\infty \frac{\tfrac14 (1 \pm \sqrt 2)^k}{3^k} = \frac{1/4}{1 - (\tfrac13 \pm \tfrac13\sqrt 2)} \\ = \frac{3}{4 \cdot (2 \mp \sqrt 2)} = \frac{3(2 \pm \sqrt 2)}{4\cdot 2} = \tfrac34 \pm \tfrac38\sqrt 2; summing these, we find k = 0 a n = 3 4 + 3 4 + 3 8 2 + 3 4 3 8 2 = 9 4 2.25 . \sum_{k=0}^\infty a_n = \tfrac 34 + \tfrac34 + \tfrac38\sqrt 2 + \tfrac 34 - \tfrac38\sqrt 2 = \tfrac 94 \approx \boxed{2.25}.

This is how I solved it. Thank you for posting the solution.

Hosam Hajjir - 5 years, 1 month ago

Just a typo, 9 4 = 2.25 \dfrac{9}{4} = 2.25 and not \approx

Ishan Singh - 5 years, 1 month ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...