Suppose you have a recurrence relation like:
And you want to find the closed form, of it ( i.e ).
In the Mathematics for the analysis of Algorithms, by Knuth and Greene it has the following procedure:
We construct a function G(z):
Then we multiply (1) by and sum over all n obtaining:
And now it says that we would like to recover the coefficient of in G(z).
a) But what does that mean? The only z powers i see in the last equation is , , . So what coefficient of is he talking about?
And then it says that if the denominators of the fractions in G(z) where linear the recovery problem would be simple and that each term would just be a geometric series?
b) How come the last one? What exactly does it mean?
And now the most important question, which is about the derivation of the solution.
Book continues saying that since the denominators of the fractions in G(z) are not linear, we express the solution for G(z) in partial fractions so we obtain:
And now it says that we should note that the only nonlinear denominators are just higher powers of a linear factor.
So these terms can be expanded by the binomial theorem and then can be easily computed to be:
c) So my question is: How can be easily computed from (2)???? I don't get it.
Any help with a), b), c) questions and especially with c)?
Thanks in advance.