Second Week - SLOG

On the second week of the class, the first problem set was due.
The questions were very straight forward, especially the first question about the proof of unit digits.
Since it wasn't the first time introducing the concept of induction, it was not a hard task to write down a proof following a proper structure. Although I still required plenty of time to think the logic neccesary for a given question to write more precise and neat proof.
But I strongly believe that I will overcome this in someday by trying out more questions.

In the lecture, a concept of complete induction had introduced. the concept was very similar to the ones that are simple inductions, but instead of proving p(n+1) from p(n), we assumed all the cases before n are true, and prove p(n) by using those cases.

I assume this will be used for the upcomming problem set #2 and assignemnt #1.