Wednesday, October 15, 2008

Problem Set 3

So after reading problem set 3, and writing a lot of draft work and equating equations together, i finally came up with the closed-form for G(n), although certainly not something like we've done in class, but it certainly only requires a value n, and nothing else to solve for G(n) and satisfy closed-form expressions, and it works, now that is left for me to do, is write out the proof.

1 comment:

Danny Heap said...

Yes, there was an unfortunately impression left that problem set #3 would be like the Fibonacci closed form. Sorry about that.