Sum of First n Odd Numbers = n² (Complete Guide)
๐ Table of Contents
- Sequence of Odd Numbers
- Step-by-Step Example
- General Formula
- Mathematical Proof
- Visual Understanding
- Key Takeaways
1. Sequence of Odd Numbers
Odd numbers follow a simple pattern:
1, 3, 5, 7, 9, 11, ...
The formula for the \(n\)-th odd number is:
$$ a_n = 2n - 1 $$a_n = 2n - 1
This means each term increases by 2.
2. Step-by-Step Example (n = 6)
First 6 odd numbers:
1, 3, 5, 7, 9, 11
\(1 + 3 = 4\)
\(4 + 5 = 9\)
\(9 + 7 = 16\)
\(16 + 9 = 25\)
\(25 + 11 = 36\)
Final sum:
$$ 1 + 3 + 5 + 7 + 9 + 11 = 36 $$Now compare:
$$ n^2 = 6^2 = 36 $$3. General Formula
The sum of first \(n\) odd numbers:
$$ S = 1 + 3 + 5 + \dots + (2n - 1) $$Using summation notation:
$$ S = \sum_{k=1}^{n} (2k - 1) $$4. Mathematical Proof
We use arithmetic series:
$$ S = \frac{n}{2} (first + last) $$Substitute values:
$$ S = \frac{n}{2} (1 + (2n - 1)) $$Simplify:
$$ S = \frac{n}{2} (2n) $$ $$ S = n^2 $$Thus proven:
$$ \sum_{k=1}^{n} (2k - 1) = n^2 $$5. Visual Understanding ๐ก
This concept can be visualized using squares:
- 1 = 1²
- 1 + 3 = 4 = 2²
- 1 + 3 + 5 = 9 = 3²
- 1 + 3 + 5 + 7 = 16 = 4²
๐ฏ Key Takeaways
- Odd numbers follow \(2n - 1\)
- Sum grows as perfect squares
- \(\sum (2k-1) = n^2\)
- Useful in algorithms & math proofs
Conclusion
The identity \(1 + 3 + 5 + ... = n^2\) is one of the most elegant results in mathematics. It connects simple number patterns with geometric intuition and algebraic proof.