Saturday, November 21, 2015

sequences and series - How can I evaluate sumin=0nfty(n+1)xn?


How can I evaluate n=12n3n+1

? I know the answer thanks to Wolfram Alpha, but I'm more concerned with how I can derive that answer. It cites tests to prove that it is convergent, but my class has never learned these before. So I feel that there must be a simpler method.


In general, how can I evaluate n=0(n+1)xn?


Answer




No need to use Taylor series, this can be derived in a similar way to the formula for geometric series. Let's find a general formula for the following sum: Sm=mn=1nrn.


Notice that SmrSm=mrm+1+mn=1rn=mrm+1+rrm+11r=mrm+2(m+1)rm+1+r1r.


Hence Sm=mrm+2(m+1)rm+1+r(1r)2.

This equality holds for any r, but in your case we have r=13 and a factor of 23 in front of the sum. That is n=12n3n+1=23limmm(13)m+2(m+1)(13)m+1+(13)(1(13))2=23(13)(23)2=12.


Added note:


We can define Skm(r)=mn=1nkrn.

Then the sum above considered is S1m(r), and the geometric series is S0m(r). We can evaluate S2m(r) by using a similar trick, and considering S2m(r)rS2m(r). This will then equal a combination of S1m(r) and S0m(r) which already have formulas for.


This means that given a k, we could work out a formula for Skm(r), but can we find Skm(r) in general for any k? It turns out we can, and the formula is similar to the formula for mn=1nk, and involves the Bernoulli numbers. In particular, the denominator is (1r)k+1.


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