Recall that the basic goal with a recursively-defined sequence, is to find an explicit formula for the nth term of the sequence. Generating functions will allow us to do this.
- 7.1: What is a Generating Function?
- A generating function is a formal structure that is closely related to a numerical sequence, but allows us to manipulate the sequence as a single entity, with the goal of understanding it better.
- 7.2: The Generalized Binomial Theorem
- We are going to present a generalised version of the special case of Theorem 3.3.1, the Binomial Theorem, in which the exponent is allowed to be negative.
- 7.3: Using Generating Functions To Count Things
- As you might expect of something that has come up in our study of enumeration, generating functions can be useful in solving problems about counting. We’ve already seen this in the Binomial Theorem. In fact, the argument we used to prove the Binomial Theorem explained why this works. Therefore, we can use similar reasoning to solve other counting questions.
- 7.4: Summary
- This page contains the summary of the topics covered in Chapter 7.