0

What is the proof of $n^2 = 1 + 3 + 5 + ... + (2\times n - 1)$?

While I verified that this is true for small numbers, I am looking for a mathematical proof for all Natural Numbers .

math_man
  • 1,574
  • 3
    observe that $(n+1)^2 = n^2 + (2n +1)$ and use mathematical induction – mm-aops Sep 27 '14 at 13:26
  • Are you familiar with induction? – drhab Sep 27 '14 at 13:26
  • Are you looking for a formal proof? If so, look at mathematical induction. Or are you looking for an "at sight" proof, that uses a diagram to make it look obvious? If so, cut up a square with side $n$ into pieces of size $1$, $3$, etc. – Rory Daulton Sep 27 '14 at 13:26

6 Answers6

4

A different approach $$S=1+3+\cdots+2n-1$$ $$S=2n-1+2n-3+\cdots +1$$ adding both of them yields $$2S=2n+2n+\cdots+2n$$ implying $$2S=(2n)\cdot n $$ thus $$S=n^2$$

Mathronaut
  • 5,120
2

To supplement the answers already given, there is also a geometric proof of this result.

For example:

$~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~$ enter image description here

$$ 1 + 3 + 5 + 7 + 9 = 5^2 $$

1

By induction, it is true for $n=1$, this is immediate. Suppose it is true for $n$, then let us calculate $(n+1)^2$ using the hypothesis of induction

$$(n+1)^2=n^2+2n+1=1+3+\cdots +(2n-1)+(2n+1)=1+3+\cdots +(2n-1)+(2(n+1)-1)$$ And the formula is true for $n+1$ we are done!

math_man
  • 1,574
0

Using the summation formula of Arithmetic Series $$\sum_{r=1}^n(2r-1)=\frac n2(1+2n-1)$$


Alternatively, $$2r-1=r^2-(r-1)^2$$

Now set $r=1,2,\cdots,n-1,n$ and add

See also: Telescoping series

0

If you already know the formula for the sum of all the positive integers between $\;1\;$ and $\;n\;$ you can do as follows:

$$1+3+5+\ldots+(2n-1)=1+2+3+4+\ldots+(2n-1)+2n-(2+4+\ldots+2n)=$$

$$=\frac{2n(2n+1)}2-2(1+2+\ldots+n)=n(2n+1)-n(n+1)=n^2$$

Timbuc
  • 34,191
0

$1+3+5+\cdots+(2n-1)=\frac{(1+2n-1)\times n}{2}=n^2$

Paul
  • 20,553
  • 2
    Please consider elaborating on this answer to make it more useful to the author of the question. –  Sep 27 '14 at 14:02