Agenda
<aside> 📌 Reminders
Mathematical induction is a method of proving statements or formulas that apply to all natural numbers.
Let's prove that the sum of the first $n$ natural numbers is given by:
$$ 1 + 2 + \dots + n = \frac{n(n + 1)}{2} $$
The base case holds.
$$
1 = \frac{1 \cdot (1 + 1)}{2} = 1
$$
Inductive Hypothesis: Assume the formula is true for $n = k$, so
$$ 1 + 2 + \dots + k = \frac{k(k + 1)}{2} $$
Inductive Step: Prove the formula for $n = k + 1$:
$$ 1 + 2 + \dots + k + (k + 1) = \frac{k(k + 1)}{2} + (k + 1) $$
Simplifying, we get:
$$ = \frac{k(k + 1) + 2(k + 1)}{2} = \frac{(k + 1)(k + 2)}{2} $$
Thus, the formula holds for $n = k + 1$.
Since both the base case and inductive step hold, the formula is proven by induction.

