Thursday, January 26, 2017

sequences and series - Sum: sumin=1nftyprodnk=1frackk+a=frac1a1



For the past week, I've been mulling over this Math.SE question. The question was just to prove convergence of
n=1n!(1+2)(2+2)(n+2)
but amazingly Mathematica told me it had a remarkably simple closed form: just 1+2. After some fiddling, I conjectured for a>1:



n=1nk=1kk+a=n=1n!(1+a)(2+a)(n+a)=1a1



I had been quite stuck until today when I saw David H's helpful answer to a similar problem. I have included a solution using the same idea, but I would be interested to know if anyone has another method.



Answer



Here is a completely elementary proof, which only needs introductory calculus concepts:



an+1=(n+1)!(a+1)(a+2)(a+n+1)=1a1((n+1)!(a+1)(a+2)(a+n)(n+2)!(a+1)(a+2)(a+n+1))=bn+1bn+2



where an is the term of our series and bn=1a1(n!(a+1)(a+2)(a+n1)) with b1=1a1



Thus the sum we seek, telescopes!



Giving us




nk=1ak=nk=1(bkbk+1)=b1bn+1



Thus we just need to compute limbn



(we basically need to show that bn0 to match the limit being 1a1)



Now we have that a>1, so let a=1+x for x>0.



(a1)bn=n!(a+1)(a+2)(a+n1)=1(1+x/2)(1+x/3)(1+x/n)




Let M=x and consider the product



pn=nk=M(1+xk)



It is enough to show that logpn (that proves that bn0).



Now we have that 11+t>1t for 0<t1 and thus integrating between 0 and y (where y1) we get that



log(1+y)yy22




Now logpn=nk=Mlog(1+xk)



nk=M(xkx22k2)



This goes to as the harmonic series diverges, and the sum of reciprocals of the squares converges.



Thus the sum of your sequence is b1=1a1


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...