In this lesson, students learn how to use generating functions to solve counting problems, specifically recurrence equations. The lecture begins with a discussion on different phobias and then transitions to a review of previous lectures before introducing generating functions. The lecture then goes into detail on the Fibonacci numbers, using them as an example to demonstrate how to solve recurrence equations using generating functions. The goal is to get a closed form for f of x, which represents the coefficients in the generating function.
Learn more about using generating functions and how they can solve counting problems.
More information about this course:
http://www.aduni.org/courses/discrete
Licensed under Creative Commons Attribution ShareAlike 2.0:
http://creativecommons.org/licenses/by-sa/2.0/