Stamp like crazy!

Date: September 19, 2008

We handed our problem set 1 to the prof today, I wouldn't say it is too hard as the questions are just a variation of the proofs we did in lecture, still... I'm pessimistic that I might not get a high mark (from last year's experience with CSC165 assignments) since I'm afraid that I didn't explain every step clear enough.

Continued on with this course, we did a question that was given to us as an exercise back in CSC165, the question simply asks what postage can be formed with 2 different valued stamps.

I remembered solving this question rather easily in CSC165, but looking at the proof Danny wrote kind of threw me off at first, but I understood it right afterward.

We also managed to write down the definition of the Principle of Well Ordering, which is states as: every non-empty subset of natural number has a smallest integer. It's a rather obvious fact, but proving it will be kind of hard...

Back to the second problem set, oh dear... what number > k can I form a postage with 5 and 11 cent stamps...

I always have this kind of problem... staring blankly at a proof, guess it takes awhile for me to get the question and the rough idea to sink deeply in my head.