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=1n∏k=1kk+a=∞∑n=1n!(1+a)(2+a)⋯(n+a)=1a−1
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)=1a−1((n+1)!(a+1)(a+2)…(a+n)−(n+2)!(a+1)(a+2)…(a+n+1))=bn+1−bn+2
where an is the term of our series and bn=1a−1(n!(a+1)(a+2)…(a+n−1)) with b1=1a−1
Thus the sum we seek, telescopes!
Giving us
n∑k=1ak=n∑k=1(bk−bk+1)=b1−bn+1
Thus we just need to compute limbn
(we basically need to show that bn→0 to match the limit being 1a−1)
Now we have that a>1, so let a=1+x for x>0.
(a−1)bn=n!(a+1)(a+2)…(a+n−1)=1(1+x/2)(1+x/3)…(1+x/n)
Let M=⌈x⌉ and consider the product
pn=n∏k=M(1+xk)
It is enough to show that logpn→∞ (that proves that bn→0).
Now we have that 11+t>1−t for 0<t≤1 and thus integrating between 0 and y (where y≤1) we get that
log(1+y)≥y−y22
Now logpn=n∑k=Mlog(1+xk)
≥n∑k=M(xk−x22k2)
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=1a−1
No comments:
Post a Comment