Generating Functions

  • George Pólya
  • Robert E. Tarjan
  • Donald R. Woods
Part of the Progress in Computer Science book series (PCS, volume 4)

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 ways 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.

Keywords

Product Rule Recursion Formula Separation Point Binary Representation Geometric Series 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1983

Authors and Affiliations

  • George Pólya
    • 1
  • Robert E. Tarjan
    • 2
  • Donald R. Woods
    • 3
  1. 1.Department of MathematicsStanford UniversityStanfordUSA
  2. 2.Bell LaboratoriesMurray HillUSA
  3. 3.Xerox CorporationPalo AltoUSA

Personalised recommendations