Skip to main content

Section 10.5 Generating functions

Introduction goes here.
  • A generating function is a formal power series in which the coefficients correspond to terms in a sequence. For a sequence \({a_n}\text{,}\) the generating function is
    \begin{equation*} G(x) = \sum_{n=0}^{\infty} a_n x^n. \end{equation*}
  • Generating functions can be manipulated algebraically to find closed-form expressions for sequences. For example, if we have a sequence defined by a recurrence relation, we can express it as a generating function and solve for it.
  • Binomial series:
    \begin{equation*} (1+x)^r = \sum_{n=0}^{\infty} \binom{r}{n} x^n \end{equation*}
    where \(\DS\binom{r}{n} = \frac{r(r-1)(r-2)\cdots(r-n+1)}{n!}\text{.}\)
  • Example combinatorics problem: counting the number of ways to distribute \(n\) identical balls into \(k\) distinct boxes. The generating function for this problem is
    \begin{equation*} G(x) = \left( \frac{1}{1-x} \right)^k = \sum_{n=0}^{\infty} \binom{n+k-1}{k-1} x^n. \end{equation*}