1. I didn't really see many differences between this section and 6.1. Was the difference that now, instead of the base case being 1, the base case can be any number that is the least element of a well-ordered set?
2. I thought that the examples for this section were interesting, because they were a lot different from the examples in 6.1. For example, I didn't think about using induction to prove something like 2^n > n. That seems tricky.
No comments:
Post a Comment