Introduction to proof and discrete mathematics

Mathematical induction

The base case, the hypothesis for one particular k, the step that carries k to k+1, and the formula whose step works perfectly and is false everywhere.

About 30 minutes7 activities Paper packet