Induction--Week 12

This week we learn  a proof technique called induction. Induction basically is used to prove something (ex: p(n) )  is true for natural number n. The idea of induction is similar to dominoes. In order to show that all the dominoes fall, we have 2 steps to do. First, we need to show that the first domino falls, and second, we assume the n-th domino fall and we can come to the result that the (n+1)th domino also falls. At first, it may be hard to understand, but students can think through the ideas of dominoes and find that the dominoes affect makes sense and it helps to understand the induction proof. I have read through some of the blogs written by the classmates and pretty agree with what they have said about the induction proof . For instance, Faye has mention the class example of how to induction work.

(http://165slog.blogspot.ca/2014/12/week-12.html)

ex: In order to prove p(n) is true for all natural number .

1. base case: p(0) is True
2.inductive step: assume p(n) is true and p(n+1) is also True

That is the way how we prove p(n) is True for all natural number.