# Sums of Squares

March 27, 2010 Leave a comment

In the past, I wrote about how the sum of the first *N* cubes is the square of the sum of the first *N* numbers. In it I remarked how finding the sum of the first *N* numbers raised to some power is easy to do using induction and telescoping series. This is fine, and probably the easiest way of doing it, but it seems a little indirect. So today I thought I’d try and come up with a more direct way of doing it, and here it is.

Define *Q* to be the sum of the first *N* squares:

The key is that it can be rewritten like this:

Rearranging the terms of the sum, we have:

And so:

Using the equation for sum of the first *N* numbers, we have:

Expanding out the sum:

Expressing the sum of squares in terms of *Q* again, and applying the formula for the first *N-1* numbers, we have:

Putting the equation in terms of *Q* yields:

Thus,

Which is the correct answer.

This proof is much less elegant than induction or telescoping series, but it has the advantage that at no point was anything clever done. It really is ‘just doing it’.