Andy from Clitheroe Royal Grammar School
sent us his work on this problem. He's given us two methods; can
you see why he prefers the second one?
We begin by summing the series
Note that this can be written as
In other words, we are writing it as a sum of geometric series!
Now, let us factorise the above sum as follows:
Wow, a product of geometric series!
We can then take a factor of
out the first bracket to leave us with
Using the geometric sum given in the question, this comes to
__
A similar method could be used for the series
,
factorising it as
, then
writing the left hand bracket as
, from which point we can use our previous sum to obtain an
answer. Unfortunately this doesn't generalise easily into higher powers,
the amount of working needed growing much larger at each stage.
A more elegant solution is differentiation. If we differentiate our first
series, we get
.
Multiplying through by
gives us
, which is the
series we need.
If
then
.
But the left-hand side is equal to
, the sequence we want
to sum.
We can resolve the right-hand using the quotient rule, and it comes to
.
__
To take it into higher powers, notice that
.
Therefore
, our next
sequence. We can differentiate the previous infinite sum and multiply by
at each stage to get the sum for the next power, and by applying the
same process to the closed-form expression, we can obtain a closed-form
expression for the next power.