Generating Functions
Encoding a sequence as the coefficients of a power series, so operations on the function read off closed formulas and recurrence solutions.
Discrete Mathematics: An Open Introduction, Generating Functions
11 exercises
Exercise 1
Find the generating function for each of the following sequences by relating them back to a sequence with known generating function.
- .
- .
- .
- .
- .
- .
- .
Exercise 2
Find the sequence generated by the following generating functions:
- .
- .
- .
- .
- (Hint: multiplication).
Exercise 4
Use differencing to find the generating function for .
Exercise 5
Find a generating function for the sequence with recurrence relation with initial terms and .
Exercise 6
Use the recurrence relation for the Fibonacci numbers to find the generating function for the Fibonacci sequence.
Exercise 7
Use multiplication to find the generating function for the sequence of partial sums of Fibonacci numbers, where , , , and so on.
Exercise 8
Find the generating function for the sequence with closed formula .
Exercise 9
Find a closed formula for the th term of the sequence with generating function .
Exercise 12
Starting with the generating function for , find a generating function for each of the following sequences.
- .
- .
- .
- . (Hint: relate this sequence to the previous one.)
Exercise 13
You may assume that has generating function (because it does). Use this fact to find the sequence generated by each of the following generating functions.
- .
- .
- .
- .
Exercise 15
Find the generating function for the sequence .
Adapted from Discrete Mathematics: An Open Introduction © 2013–2019 Oscar Levin. Licensed under CC BY-SA 4.0. Source: Discrete Mathematics: An Open Introduction. Imported at revision 1e2e26b.