Complete induction is very similiar to simple induction, except that for simple induction, we assume p(n) is true to show p(n+1) is true; whereas in complete induction, we assume p(0)... p(n-1) is true to show that p(n) is true. However, I find complete induction more challenging than simple induction, this might be due to the fact that I was exposed to simple induction more and complete induction is still a new concept. The theory behind the two method is the same, they both require base cases and an induction step. I guess one other challenge at this step right now is trying to figure out which method to use (either complete or simple). To get used to it, I will look more into complete induction, read the textbook pages for this topic, and do some exercises on both methods to see in which case should use what.
PROBLEM SET #1
I find the first problem set not that challenging to solve. Both questions are similiar to the examples given in class. After reading over the lecture slides, it didn't take me long to crack the problems. I think I'm getting more comfortable at simple inductions now. Just hope I can always pick up the materials of the course this fast.
Subscribe to:
Post Comments (Atom)
2 comments:
It's good if the problem got you to look at the course notes.
... Now I lost my course notes... I guess it's really worth the money to get another one...
Post a Comment