Today we have studied complete induction. Since it still part of induction approach, most of the theories are the same. However, instead of show P(n+1) from assumption of P(n), we need a stronger assumption which means we need to hpy. all the cases before the number n are correct/hold, then we need to show P(n) hold.
A simple way to know a induction is simple or complete is to see if we acturlly need mention P(n+1). Part of this because, I am not sure true or not, there is no need to show P(n+1) hold for complete.
The case we have seen in lecture is a great example to get understand the complete induction. First, there is no easy to induct from P(n) to P(n+1). Second, we need more prerequisite we need in order to induct P(n), which means we need P(n-1), P(n) all down to the lowest cases.
The full tree case is interest. I will discuss it afterwards.
No comments:
Post a Comment