2.4. Mathematical Proof Techniques¶
2.4.1. Mathematical Proof Types¶
2.4.2. Mathematical Induction¶
2.4.3. Induction Proof Examples¶
1 / 20
Settings
<<<>
Some times, reducing the solution from size of n to n-1 makes prove a theorem more easily. Another advantage to thinking in terms of 'reducing from n' rather than 'building up from n−1' is that reducing is more like what we do when we write a recursive function. In recursion, we would naturally compute some function of n by calling the function (recursively) on n−1 and then using the result to compute the value for n.