# Sum of odd numbers results in a square number [closed]

Recently I discovered by myself that sum of N sequential odd numbers will result into N2.

Can anyone explain this to me? I want to know why not a proof.

Some examples:

1                    12   1
1+3                  22   4
1+3+5                32   9
...
1+3+5+7+9+11+13+15   82  64


This is not homework, but personal knowledge. I'm also sorry in advance if it's too simple.
Also an apology if it's tagged wrong.

-

## closed as off topic by Anton GeraschenkoNov 6 '09 at 16:42

Questions on MathOverflow are expected to relate to research level mathematics within the scope defined by the community. Consider editing the question or leaving comments for improvement if you believe the question can be reworded to fit within the scope. Read more about reopening questions here.If this question can be reworded to fit the rules in the help center, please edit the question.

It is surely at the low end of what is interesting here. I recommend AoPS. – Greg Kuperberg Nov 6 '09 at 14:34
Upvoted because, although the question isn't really appropriate, the answers are great. – David Speyer Nov 6 '09 at 16:14
As Greg said, this really belongs on artofproblemsolving.com/Forum/index.php . – Anton Geraschenko Nov 6 '09 at 16:43

Draw an $n \times n$ square:

xxxx
xxxx
xxxx
xxxx
(here $n$ = 4, and there are 16 x's).

Now divide the square into $n$ symmetric L-shapes:

dcba
dcbb
dccc
dddd

As you can see, we have 1 a, 3 b's, 5 c's and 7 d's, so 16 = 1 + 3 + 5 + 7.

-

Another way of seeing this is to compare two consecutive square numbers, say n2 and (n+1)2. If we expand the larger one, we get (n+1)2=n2+2n+1, so it is exactly (2n+1) more than the previous square. As n increases, this expression represents the consecutive odd numbers. So squares always differ by consecutive odd numbers.

-

I know you didn't ask for a proof, but actually the best way of seeing WHY something happens is understanding a good, simple proof for it. Here is my try to your nice observation, using the formula for the sum of several consecutive terms of an arithmetic progression (which, by the way, has also a nice, simple proof):

You know that if $\{an+b\}$ is an arithmetic progression and you look at some of its consecutive terms, then their sum is "(the first one plus the last one) times (the number of terms added) divided by 2".

In your case, you have the progression $\{2n-1\}$, starting at $1$ and finishing in some $2N-1$, which has $N$ terms. Then, by the formula above, you get that their sum is $$S = \frac{(1+2N-1)\cdot N}{2} = \frac{2N\cdot N}{2} = N^2.$$

This, if you look at it by the reverse side, is caused by the fact that the substraction of two consecutive squares is a particular odd number, $(N+1)^2 - N^2 = N^2+2N+1-N^2 = 2N+1$. You could also use this to prove your claim by induction, but it wouldn't be, in my opinion, a clarifying proof of the kind you were looking for.

-