Math — Proof by Induction
The structure of an inductive proof.
Rendering…
Make it your own.
\text{1. base case: true for } n = 1
\text{2. assume true for } n = k
\text{3. prove true for } n = k + 1
\therefore \text{true for all } n \in \mathbb{N}
The structure of an inductive proof.
\text{1. base case: true for } n = 1
\text{2. assume true for } n = k
\text{3. prove true for } n = k + 1
\therefore \text{true for all } n \in \mathbb{N}