# Sum of odd numbers always gives a perfect square. [duplicate]

$1 + 3 = 4$ (or $2$ squared)
$1+3+5 = 9$ (or $3$ squared)
$1+3+5+7 = 16$ (or $4$ squared)
$1+3+5+7+9 = 25$ (or $5$ squared)
$1+3+5+7+9+11 = 36$ (or $6$ squared)

you can go on like this as far as you want, and as long as you continue to add odd numbers in order like that, your answer is always going to be a perfect square.

But how to prove it?

• Hint: $(n+1)^2 = n^2 + (2n + 1)$, ie, squaring the next number adds the corresponding odd number. Jan 15, 2014 at 9:44

Consider a square. It can be divided as the following: Each red segment contains odd number of circles.

• Nice geometric proof!
– A.P.
Jan 15, 2014 at 9:53
• Outrageous..... Oct 4, 2017 at 9:19

\begin{align*} \sum_{k=0}^{n}[2k+1] &= \sum_{k=0}^{n}[2k] + \sum_{k=0}^{n}1=\sum_{k=0}^{n}[2k] + (n+1)\\ &=2\sum_{k=0}^{n}[k] + (n+1)= 2\frac{n(n+1)}{2}+(n+1) = (n+1)^2 \end{align*}

Because \begin{align}1+3+5+\cdots+(2n-1)&=\sum_{k=1}^{n}(2k-1)\\&=2\sum_{k=1}^{n}k-\sum_{k=1}^{n}1\\&=2\cdot\frac{n(n+1)}{2}-n\\&=n(n+1)-n\\&=n^2.\end{align}

You can prove it by induction . Statement : $1+3+5+...+(2n-1)=n^2$

Base case : For n =1 , the LHS of statement is 1 and the RHS of the statement is 1 . So the statement is true for n=1 . Induction step : Let the statement is true .

$1+3+5+...... + (2n-1)=n^2$

So $1+3+5+...+(2n-1)+(2n+1) = n^2+2n+1 = (n+1)^2$

So the statement is true for all natural values of n .

$1+3+5+...+(2n-1)=n^2$