Second week

Date: September 15, 2008

After wasting off my weekend (besides being busy of course), I'm back at school again in the second week of my second year.

We learned Prime factorization, which is defines as: Prime factorization of n is a sequence of prime numbers with product of n. Something useful for proofs and was talked about it in CSC165.

As well, we moved on from the Principles of Simple Induction to a new flavour of induction called - Complete induction. Complete induction basically means if every elements up to n-1 implies P(n), then that suggests every n is true for a given claim (P(n)).

The special thing about Complete induction is that you don't need base cases at all (yipee?), well... it still wouldn't hurt to follow the structure in CSC165 by putting a few in. Complete induction is extremely useful in the case when the base case is either ambiguous or cannot be formed completely, so that we can just move along with the induction step.

Basically this is today's lecture, using Complete induction on claims relating to Prime factorization, oh well... that's it for this post!