Age
16 to 18
| Article by
Alex Goodwin
| Published

Sum the series



The Sum of 1 + 22 + 333 + 4444 + ... to $n$ terms



This is an extension of the NRICH problem called Clickety Click and All the Sixes , where the solution involves summing the series

1+11+111+1111+ to $n$ terms.

Each term of the series $1 + 22 + 333 + 4444 +\cdots$ can be written as $k (1 + 10 + 100 + \cdots + 10^{k -1} )$ for some value of $k$. Using geometric series theory each term can be written as $k (10^ {k} -1)/9$. So the sum $S_n$ can be written as Sn=1(10119)+2(10219)+3(10319)+4(10419)+=19(1.101+2.102+3.103+4.104++n.10n(1+2+3+4++n))=19(1.101+2.102+3.103+4.104++n.10n12n(n+1))

To find the formula for $1.10^1 + 2.10^2 + 3.10^3 + 4.10^4 + \cdots + nx^n$ consider the series y=1+x+x2+x3++xn=xn+11x1

Differentiating this expression and multiplying the derivative by x we get xdydx=x+2x2+3x3++nxn=nxn+2(n+1)xn+1+x(x1)2.

Hence 10+2.102+3.103++n.10n=n.10n+2(n+1).10n+1+1081

So the sum of $n$ terms of the original series is Sn=1+22+333+4444+=19(n.10n+2(n+1).10n+1+108112n(n+1))

Note that when $n$ is greater than 9, terms cannot be written with a repeated single digit and the $k^{th}$ term should be treated as $k (10^0 + 10^1 + 10^2 + \cdots + 10^{k-1})$.