Week 5

I was hoping on seeing my test before posting this entry but it's pretty late as it is so I will reply to this with my comments about the test when I see it.

The lectures: Well the problem set brings another lost mark from a stupid mistake, but not a bad result anyway. We discussed finding closed forms for recursively defined functions and I found this quite interesting. I have myself wondered if there was an easier way to find those Fibonacci numbers, had I known the closed form those Grade 12 Data tests would have been so much easier. At least I have a new tool in my toolbox. Finding closed forms (using the exponential method) is pretty intuitive once I saw it but I do not believe I would have ever figured out something like that.

Obviously this technique can be applied to almost any recursively defined function in some way yet the Fibonacci one in my opinion is the most interesting. The rest of the proofs were essentially things ive seen before and did have educational value but didn't catch my interest.