Weeks 2 and 3

I'm sorry for not posting anything for week 2, was a bit overwhelmed by the rush of assignments in almost all my courses, while preparing for a quiz.
The course is now what I thought it would be, a not-so-easy course. Exercises seem a bit trickier and the assignment was tricky (glad the deadline for the last question was extended). I'm learning to sorta read between the lines to determine whether or not a proof is right, using the principle of well-ordering and developing true claims from false ones. I realized that a base case is the most important part of a simple induction proof cos if you're given a false claim, you can assume it's right for 0, 1, ...., n and show that it's true for n + 1. So to prove this claim wrong you have to show it's false for your chosen base case. I also noticed when proving claims for sets of natural numbers, it almost always helps to break down the sets into 2 (or more) smaller sets, the size of each depending on the claim you're trying to prove. And for some other proofs, you just have to use tactics - which are not necessarily employed or taught in class - to prove them.
Have to go now, before quizzes and more assignments come knocking. Later daiz.