Week 3 of CSC236

Perhaps it was because I'm late almost every class now , but I start off the class being a little confused about the problem thats being taken up.Luckily Prof. Heap writes his solutions in a very understandable way so that when he starts to write the actual proof I understand the problem right away. It was very interesting to see induction proof's using the Principle of Well Ordering.I find it easier to not write base cases since its obviously less writing.Using the Principle of Well Ordering you do don't have to write the base case explicitly, but its still there because you are using the fact that there is a smallest number for which the problem is true for.

Although the 3 proofs of induction we use are similar , I did not know that they implied one another. After seeing the proof , you can see that for example proving something by complete induction , you can conclude something about the smallest element in the principle of well ordering for another fact. It would be very interesting to see a cross over of the induction proofs , maybe we'll see them later on.

I was wondering if you could prove something even though the proposition is false , and today i got to see that. It was interesting to see that even by adding 1 word like "full" with binary tree could make a difference between a correct and a wrong proof, or even how adding 1 to a constant can be used to correct a false proof. Looking forward to completing the assignment this weekend , hopefully the last question won't give me problems.

I was happy to see that the problem set 2 was quite easy , the only "difficult" part was to find out the number N for which the postage could be made. Also it was nice to see I did well in problem set 1 , hopefully I can use the problem sets to boost my mark , even if it'll be by a small factor. Looking forward to completing the assignment this weekend , hopefully the last question won't give me problems.

I found this pretty amusing.