How to compute this infinite sum?

Question

I'm trying to compute the infinite sum

$\sum_{n=1}^{\infty}n(\frac{1}{2})^n$

which I believe should represent the expected amount of coin flips needed to get a head. Can someone remind me how to do this?

Answer 1

For $|x|<1$: $\sum_{n=1}^{\infty}nx^n=x\sum_{n=1}^{\infty}nx^{n-1}=x(\sum_{n=1}^{\infty}x^{n})'$.

Can you proceed ?

Answer 2

The key is that the infinite sum $\sum x^n $ converges to $\frac 1{1 - x}$ under certain conditions on $x$, and differentiating the resulting inequality gives that $\sum nx^{n-1}$ is convergent to the derivative of $\frac 1{1 - x}$, under the same conditions. Multiplying this by $x$ gives the sum $\sum nx^{n}$, which is the result you are looking for with $x = \frac 12$, which does fall under the set for which the first equality holds.

Answer 3

For $|r|<1$, $$\begin{align} \sum_{n=1}^n nr^n=S&=r+2r^2+3r^3+4r^4+\cdots+nr^n+\cdots \tag{1}\\ rS&=\quad\;\;\; r^2+2r^3+3r^4+\cdots+(n-1)r^n+\cdots\tag{2}\\ (1)-(2):\\ (1-r)S&= r\;+r^2\;+r^3\;+r^4\ +\cdots\; +r^n+\cdots\\ &=\frac r{1-r}\\ S&=\color{red}{\frac r{(1-r)^2}} \end{align}$$ Putting $r=\frac 12$ gives $S=\color{red}2$.

Answer 4

$S=\sum_{n\geq 1}\frac{n}{2^n}$ is an absolutely convergent series, so we may apply the following manipulations: $$ S = 2S-S = \sum_{n\geq 1}\frac{n}{2^{n-1}}-\sum_{n\geq 1}\frac{n}{2^n}=\sum_{n\geq 0}\frac{n+1}{2^n}-\sum_{n\geq 1}\frac{n}{2^n}=1+\sum_{n\geq 1}\frac{1}{2^n} $$ and since $\sum_{n\geq 1}\frac{1}{2^n}=1$, $\color{red}{ S=2}$ easily follows.