The sum of the first n odd numbers is n²
Need a hint?
Think of a square of dots and add one L-shaped layer at a time, or use induction.
The sum of the first n odd numbers is n²: for example 1 + 3 + 5 + 7 = 16 = 4².
How to work it out
Induction. For both sides are 1. Suppose the formula holds for . Add the next odd number :
(1)That is the formula for , so it holds for every . Geometrically: an square of dots grows into an square by adding an L of dots.
LaTeX source of the formulas on this page
\[ n^{2} \]
\[ n^2+(2n+1)=n^2+2n+1=(n+1)^2 \]Questions
What is the answer to: The sum of the first n odd numbers is n²?
The sum of the first n odd numbers is n²: for example 1 + 3 + 5 + 7 = 16 = 4².
What is the key idea?
Each new odd number is exactly the L-shaped border that turns an n×n square into an (n+1)×(n+1) square.
Is there a hint?
Think of a square of dots and add one L-shaped layer at a time, or use induction.