# Tag Info

• (Base Case) First prove the statement for the base case, which is usually $n=0$ or $n=1$.
• (Inductive Step) Next, assume that the statement is true for an input $n$, and prove that it is true for the input $n+1$.
The following variant goes without a base case: Assuming the statement is true for all $n\in\mathbb N$ with $n < N$, prove that is true for $N$, too. This has to be done for all $N\in\mathbb N$.