CMPSCI 311: Theory of Algorithms

David Mix Barrington

Fall, 2003

Discussion Notes #2

from Wednesday 17 Sept 2003

Here we solve some recurrence relations of various types. In each case find the function of n that satisfies the recurrence and the initial conditions, and prove by induction that your answer is correct. In the case of the last three, you need only find a solution that is correct when n is a power of two. Please answer the questions during the discussion period.

Last modified 17 September 2003