This is the third week and I think I am getting used to the inductions. Hope to be very clear on these soon. The second problem set is due on also Friday and it is also pretty much the same as the one we covered in the lecture. Also, I have found the similar problem in the textbook, so with this well-organized explanation, it will not take me long time to solve it. However, the biggest problem seems to find the minimal number of N.
- Will it take forever if I try to find a formula for N? I am asking whether there is a formula that works for any type of question. If not, I will just substitute some numbers.
The topic for this week is 'more principle of Well-Ordering Equivalence of induction flavors Traps and tricks'. The topic is pretty much talks about that if you believe one, you must believe other two principles. Honestly, I did not fully understand between these three principles during the lecture.
This is question for myself about this topic : I am thinking why the connection between these three principles are so important to know? I feel better if I learn which type of principle is applied to which problem because I am still confused which one I should use.
The first assignment is due next Monday. I am not too worried about the assignment yet but better get started soon.
No comments:
Post a Comment