Saturday, December 16, 2017

The sum of the series frac1516+frac1516timesfrac2124+frac1516timesfrac2124timesfrac2732+dots





Suppose S=1516+1516×2124+1516×2124×2732+
Does it converge? If so find the sum.



What I attempted:- On inspection of the successive terms, it easy to deduce that the nth term of the series is tn=(34)n5.7.9.(2n+3)4.6.8.(2n+2)



Thus tn+1tn=34×2n+52n+4. As n this ratio tends to 34<1. Hence by Ratio test it turns out to be convergent.



A similar type of question has already been asked here. One of the commenters has provided a nice method to evaluate the sum of such series using recurrence relation and finally using the asymptotic form of Catalan Number.



To proceed exactly in the similar way, I wrote tn as follows:-
tn=13(38)n1.3.5.7.9.(2n+3)(n+1)!=13(38)nn+22n+2(2n+4n+2)(34)n1n+2π(For large n).




I have used the recurrence relation Sn=Sn1+Tn, along with the initial condition S1=1516, in order to get a solution like this Sn=7.5+T2nTnTn1.



I am getting trouble in evaluating the limit of the second term as n.



I haven't cross checked all the steps. Hope I would be pointed in case of any mistake.


Answer



Let
f(x)=n=1tnxn=n=15×7××(2n+3)4×6××(2n+2)xn.
Then
tn=231(n+1)!(32)(52)(2n+32)=23un+1
where
un=(3/2)(5/2)((2n+1)/2)n!.
Then, for |x|<1,
n=0unxn=1(1x)3/2
by the binomial theorem.
Then

f(x)=23n=1un+1xn=23n=2unxn1=23x(1(1x)3/213x2)
Now insert x=3/4.


No comments:

Post a Comment

analysis - Injection, making bijection

I have injection f:AB and I want to get bijection. Can I just resting codomain to f(A)? I know that every function i...