Lecture 9: Generating Functions

This lecture continues the theme of using Maple to investigate the performance of algorithms and generating combinatorial objects. The lecture introduces generating functions which are a very important tool for analyzing integer sequences, recurrence relations, and combinatorial objects.

Background Material


Review the material on generating combinatorial objects in Also study Maple's series command.


Maple worksheets and programs and other resources


Created: Oct. 26, 2006 by jjohnson@cs.drexel.edu