In this module, we will learn about Mathematical proof techniques.

This module will continue discussing the mathematical proof techniques.

This module will provide more examples for Mathematical Induction proofs.

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.

This Module provides an example that shows how induction can be used to prove that a recursive function produces the correct result.