Originally Posted by

**inflames098** The question:

***Use mathematical induction to prove the product rule for m tasks from the product rule for two tasks.***

**The Product Rule for counting states:** **The Product Rule: Suppose that a procedure can be broken down into a sequence of two tasks. If there are n**_{1} ways to do the first task and for each of these ways of doing the first task, there are n_{2} ways to do the second task, then there are n_{1}n_{2} ways to do the procedure.

Base Case: I choose P(m) = 4, which is the product rule for two tasks.