You can put this solution on YOUR website! + . . . +
Proof by induction.
For n = 1, the statement is trivially true.
Assume the statement is true for some natural number n = k,
or + . . . +
Then by adding on both sides, we get
+ . . . +
=, and the statement is proved...