All courses › Mathematics R2 › Sum of the first odd numbers

Sum of the first odd numbers

The sum of the first nn odd numbers is n2n^2. The first is 1, the second is 3, and the nnth is 2n−12n - 1. The base case is 1=121 = 1^2. In the step you add the next odd number 2k+12k + 1, and k2+2k+1k^2 + 2k + 1 is the square of k+1k + 1. A concrete count checks the formula, while induction shows that it holds for every nn.

1+3+⋯+(2n−1)=n21 + 3 + \dots + (2n-1) = n^2the odd numbers

Symbols

nnthe number of odd numbers

Example

The first 50 odd numbers end at 9999, and the sum is 502=250050^2 = 2500. The first four are 1+3+5+7=16=421 + 3 + 5 + 7 = 16 = 4^2.

The number of terms is nn, not the last odd number. Fifty terms give 50250^2, not 99299^2.
Practise proof by induction for free →

← The sum of the first numbers · Sum of squares and a geometric sum →

Part of Mathematics R2: Proof by induction.