This video is all about generating functions, covering:
•Ordinary generating functions
•Generating functions for binomial coefficients using n or k
•A generating function for the Fibonacci sequence
•Rules for manipulating generating functions
•Convolutions/Cauchy products of generating functions
•Notable examples of generating functions
•Steps for finding the closed form of a generating function
•A worked example given a recurrence relation
As well as a handful of functions within the Wolfram Language, including:
•GeneratingFunction[]
•Series[]
•SeriesCoefficient[]
This video was written by Alistair Forsyth as part of the series “Discrete Calculus with the Wolfram Language”.
