Subject: Recurrence Relation solution
From: "William J. Rapaport" <rapaport@buffalo.edu>
Date: Sun, 29 Nov 2009 13:23:19 -0500 (EST)

On Monday, I posted a problem for you to "solve" a recurrence relation,
i.e., to find an "explicit"--i.e., non-recursive--formula for a
function (a sequence) defined by a set of initial conditions and a
recurrence relation.

The problem is in the Email Archive at:
http://www.cse.buffalo.edu/~rapaport/191/F09/EMAIL/20091123-RecurrenceRelationProblem

If you have not yet tried it, I strongly urge you to do it as soon as
possible (so that you don't forget about it), because there *will* be a
question like this on the final exam.

The solution has now been posted at:
http://www.cse.buffalo.edu/~rapaport/191/F09/EMAIL/20091129-RecurrenceRelationSolution

Check your answer against mine. If they differ, try to figure out why.
If you can't figure it out, please ask your TA to explain it.