6th Entry

So I managed to finally figure out the solution for Problem Set 3! It took some work, but with the help of my friends and some time to think it over, I realized I was a lot closer then I thought!

I unwound G(n) to the point where I found the geometric sequence -- I just wasn't sure if this was a "closed form" of G(n). A friend of mine spoke to Danny and realized that we had it down, it was just a matter of manipulating the closed form to get the equation: (1 - r^n+1 / 1 - r) -- which I then used simple induction on to prove for the n and the n+1th term. So yeah, at least I think I did it right!

Next week is going to be really busy. We have started our first "sprint" in CSC207, so balancing that out with a Problem Set and Assignment in 236 is going to be tough. Once everything gets rolling it should be ok, it's just a matter of getting things to "roll" in the first place...

I'm happy with my mark on the first midterm. I expected to do a little better, but I totally messed up the Fibbonacci question. I used complete-induction like we were supposed to, but I don't think I "used" it efficently enough to prove the question. Oh... and I only used 1 base case instead of 2. I should've known Danny was going to put a question in with 2 base cases!

So yep, week 7 starts tomorrow and I'm ready for it. I want this recursive stuff to be over with soon... I'm curious to see what we're going to learn about next!

... And now I'm all up to date on my Slog posts too. Yesssssss.