You can check it by working out the left hand side to get 1 + 8 = 9, and the right hand side gives 3^{2} = 9.

But look: 1^{3} + 2 ^{3} + 3 ^{3} = (1 + 2 + 3)^{2}.
The left hand side gives 1 + 8 + 27 = 36 and the right hand side is just 6^{2} = 36.

The odd bit is that this also works for: 1^{3} + 2 ^{3} + 3 ^{3} + 4 ^{3} = (1 + 2 + 3 + 4)^{2} because they both come to 100.
In fact if you stick to the pattern, you can make the sum as long as you want. We can show this with our *mystery* formula:

This ALWAYS works!

## TRIANGLE NUMBERS
If you arrange counters in triangular patterns, you get the triangle numbers. (The smallest "triangle" only needs one counter so it doesn't look much like a triangle.)
To save time the "n If you wanted to work out the third triangle number without using counters you just put
T Otherwise you can use the triangle number formula:
To work out T |

The secret is that (1 + 2 + 3 + 4 +... +n) makes the n^{th} TRIANGLE NUMBER. Triangle numbers are explained in More Murderous Maths and Numbers, but all you need to know for now is in the black box with the groovy orange writing.

When you have (1 + 2 + 3 + ... n)^{2}, then you are working out the n^{th} triangle number squared. To make this easier to write we can put (T_{n})^{2}.
Now we can make our mystery formula a bit neater:

1^{3} + 2 ^{3} + 3 ^{3} + 4 ^{3} +....+ n ^{3} = (T_{n})^{2}

Suppose instead of going up to number n we went up to the next number: (n+1). We'd get:

1^{3} + 2 ^{3} + 3 ^{3} + 4 ^{3} +....+ n ^{3}+(n+1)^{3} = (T_{(n+1)})^{2}

Let's see how the two sides have changed. On the left hand side, we've just added on an extra (n+1)^{3}. On the right hand side it's a bit more complicated. We had the n^{th} triangle number squared, now we've got the (n+1)^{th} triangle number squared. What we need to show is that the difference between (T_{(n+1)})^{2} and (T_{n})^{2} is (n+1)^{3}.

The formula for T_{n} is in the box, and to get the formula for T_{(n+1)} we just replace n with (n+1).

We get T_{(n+1)} = {(n+1)(n+2)/2 }

Now when we work out (T_{(n+1)})^{2} - (T_{n})^{2} we get:

{(n+1)(n+2)/2 }^{2} - { n(n+1)/2 }^{2}

= (n+1)^{2}(n+2)^{2}/4 - n^{2}(n+1)^{2}/4

Both bits contain (n+1)^{2}/4 so we can "factorise" - which means taking it out and
putting it at the front.

= {(n+1)^{2}/4} x {(n+2)^{2} - n^{2}}

= {(n+1)^{2}/4} x { n^{2} +4n +4 - n^{2}}

= {(n+1)^{2}/4} x {4n +4}

= {(n+1)^{2}/4} x 4{n +1}

= (n+1)^{2} x (n+1)

= (n+1)^{3}

That's the answer we wanted to see! We've shown that the difference between (T_{(n+1)})^{2} and (T_{n})^{2} is (n+1)^{3}, and that's why our mystery formula always works!