How to Use:
- Define the statement I(n) to be proven for each n
- Prove the base case
- Given that the kth case is true, prove that the (k + 1)th case is true
Reasons to Use
- Show that something is true for all natural numbers, or a well-ordered set
Click here to view just the question for the example proof by induction. If you would like to see the worked out solution to the proof by induction problem, click here.