Abstract
Generating functions are a general mathematical tool developed by de Moivre, Stirling, and Euler in the 18th century, and are used often in combinatorics. As usual, we start by taking a concrete example: In how many can you make change for a dollar? We’ll assume that we’re dealing with only five types of coins–pennies, nickels dimes, quarters, and half dollars.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2010 Birkhäuser Boston
About this chapter
Cite this chapter
Pólya, G., Tarjan, R.E., Woods, D.R. (2010). Generating Functions. In: Notes on Introductory Combinatorics. Modern Birkhäuser Classics. Birkhäuser Boston. https://doi.org/10.1007/978-0-8176-4953-1_3
Download citation
DOI: https://doi.org/10.1007/978-0-8176-4953-1_3
Published:
Publisher Name: Birkhäuser Boston
Print ISBN: 978-0-8176-4954-8
Online ISBN: 978-0-8176-4953-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)