CSC236 SLOG #2

So many things were going on last week, I have missed the class last Thursday. I am trying to go through the contents and catch up. The new material is kind of long and complex.
Recurrence is an interesting ideal in mathematic proofs. It's a different way of thinking comparing with the original straight forward manipulation. And in some sense, I feel like induction is mean to be used in proving recurrence problems, because the each recursive step is one step toward the base case, it's like the induction being reversed.
Another thing that is interesting is the master theorem in the end of last thursday's lecture. It's sweet to have such simple theorem that work on many recursive problems. I am trying to figure out the reasoning behind the theorem.

CSC236 SLOG #1

This is a blog that I have created for some time. I sometimes post articles about interesting thoughts that I come up with. I don't mind to put the CSC236 SLOG in the blog, since the SLOG will capture some valuable experience in the course. However, I will start the title as CSC236 SLOG to help people distinct the blog from my other blogs.

I use to write lots of blogs in other place, blog is like a diary book that you keep for other people to see. But then, I was too busy to keep writing blogs. What a shame. I think it is great we can earn some marks by just writing blogs.

Regarding the course, I have some thoughts that I want to share with you guys. In Assignment one, question 3, I got a formula by my inference:
for any set with n+3 elements, there are [(n+2)(n+1) + (n+1)(n) + ... + (2)(1)] / 2 3-subsets.
I believe the formula give same output as the combination formula we otherwise use. It's just I don't know how to simplify the formula. If you know a way to simplify the formula please let me know.