Monday, May 22, 2017

summation - Finite Sum sumni=1fraci2i




I'm trying to find the sum of :



ni=1i2i



I've tried to run i from 1 to , and found that the sum is 2 , i.e :



i=1i2i=2



since :




(1/2+1/4+1/8+)+(1/4+1/8+1/16+)+(1/8+1/16+)+=1+1/2+1/4+1/8+=2



But when I run i to n , it's a little bit different , can anyone please explain ?



Regards


Answer



For the sake of generality, and more importantly to make typing easier, we use t instead of 1/2.



We want to find the sum

S(t)=t+2t2+3t3+4t4++(n1)tn1+ntn.


Multiplying both sides by t, we get
tS(t)=t2+2t3+3t4+4t5++(n1)tn+ntn+1.

Subtract, and rearrange a bit. We get
(1t)S(t)=(t+t2+t3+++tn)ntn+1.

Recall that for t1, we have t+t2+t3+++tn=t1tn1t.
If we do not recall the sum of a finite geometric series, we can find it by a trick similar to (but simpler) than the trick that got us to ().



Substitute, and solve for S(t). (The method breaks down when t=1 because of a division by 0 issue. But t=1 is easy to handle separately.)



Remark: Now that we have obtained an expression for nk=1ktk, we can use this expression, and the same basic trick, to find nk=1k2tk, and then nk=1k3tk. Things get rapidly more unpleasant, and to get much further one needs to introduce new ideas.



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