All courses › Mathematics R2 › The sum of the first numbers

The sum of the first numbers

The sum 1+2+⋯+n1 + 2 + \dots + n is n(n+1)/2n(n + 1)/2. The formula is proved by induction. The base case is n=1n = 1, where both sides are 1. In the induction step you assume that the formula holds for kk, add the next number k+1k + 1, and show that you get the formula for k+1k + 1. Then it holds for every natural number. You must use the hypothesis in the step.

1+2+⋯+n=n(n+1)21 + 2 + \dots + n = \frac{n(n+1)}{2}the sum formula

Symbols

nnhow many numbers are added

Example

1+2+⋯+100=100⋅1012=50501 + 2 + \dots + 100 = \dfrac{100\cdot 101}{2} = 5050. The base case n=1n = 1 gives 1⋅22=1\dfrac{1\cdot 2}{2} = 1.

In the induction step you should add the term k+1k + 1, not start over without the hypothesis.
Practise proof by induction for free →

← Area when the graph changes side · Sum of the first odd numbers →

Part of Mathematics R2: Proof by induction.