Skip to main content
\(\newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\) \( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\) \( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\) \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\) \( \newcommand{\Span}{\mathrm{span}}\)
Mathematics LibreTexts

4.3: Generating Functions and Recurrence Relations

  • Page ID
    6112
  • [ "article:topic", "authorname:kbogart" ]

    \( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

    \( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)

    Recall that a recurrence relation for a sequence \(a_{n}\) expresses \(a_{n}\) in terms of values \(a_{i}\) for \(i < n\). For example, the equation \(a_{i} = 3a_{i}−1+2^{i}\) is a first order linear constant coefficient recurrence.

    4.3.1 How Generating Functions are Relevant

    Algebraic manipulations with generating functions can sometimes reveal the
    solutions to a recurrence relation.