📚 Discrete Mathematics
⇩ Download ▾

Chapter 6: Additional Topics

There is an extremely powerful tool in discrete mathematics used to manipulate sequences called the generating function. The idea is this: instead of an infinite sequence (for example: 2 , 3 , 5 , 8 , 12 , ) we look at a single function which encodes the sequence. But not a function which gives the n th term as output. Instead, a function whose power series (like from calculus) “displays” the terms of the sequence. So for example, we would look at the power series 2 + 3 x + 5 x 2 + 8 x 3 + 12 x 4 + which displays the sequence 2 , 3 , 5 , 8 , 12 , as coefficients.

An infinite power series is simply an infinite sum of terms of the form c n x n were c n is some constant. So we might write a power series like this:

Discrete Mathematics: An Open Introduction, 3rd edition, by Oscar Levin (discrete.openmathbooks.org), licensed under CC BY-SA 4.0; this adaptation is distributed under the same license. License: CC-BY-SA-4.0.

These eBooks are a prerelease and are not yet certified conformant with WCAG 2.1 AA or ADA Title II. Every page is built against an automated accessibility gate, and the published editions will meet ADA Title II requirements when they release in late September 2026. If something is unusable, please tell us.