# Sum of Pairs of Integers less than N

April 4, 2010 2 Comments

What is the sum of all (ordered) pairs of integers less than *N*? That is, what is the value of this:

Now this is very easy to determine. One way is to notice that it is the same as:

You can see this by imagining the expansion of square on the left hand side. Alternatively you can get the same result by just evaluating the sum in the obvious way. (Move the *i* outside the inner sum, evaluate the inner sum, and move the result out of the remaining sum.)

However, I have remarked before about how the square of the sum of the first *N* numbers is equal to the sum of the first *N* cubes. Therefore we have the equality:

So this is easy to prove it is true by recognising what the sum on the left really is, but is there a more direct way of seeing it? It just isn’t obvious that the sum of the pairs of integers should be the sum of cubes less than that number!

In fact it is very easy to see. The sum can just be rewritten as:

To convince yourself that no terms have been lost, note that on the left hand side there are terms, whilst on the right there are for each *i*(There are not *2i* as when *i=j* there is nothing for it to pair with) and so, using the formula for the sum of the first *N* numbers, there are terms on the right. Obviously no term has been repeated and so they are equal.

Then we just have:

And so it is shown. A very simple result, but I like seeing these relationships directly.

Hi, I read your article, but I can’t see the images, so I can’t see the math. Could you please do something about this (e.g. reload the images, or mail me your article in plain text)?

Thanks

Fixed!