week 6

Right now I'm currently busy with assignment #2.  In general, I'm finding divide and conquer recurrences kind of tricky.  Proving a conjecture based upon a more simply defined function such as Fibonacci sequence looked to be much more straightforward.  Trying to deal with complexity, as well as the ceilings and floors looks to add a new degree of difficulty.  But I suppose its a matter of working through it.  The last question on the assignment looks tough, and deals with a divide and conquer recurrence.  I imagine it will be a lot of work to tackle proving a tight asymptotic bound.  I'll write up another post later in the week, after I really get into the assignment.