Peter Shor continues MIT's 18.200, Principles of Discrete Applied Mathematics, with a lecture on using generating functions to solve linear recurrence equations. He walks through deriving a closed-form expression for the Fibonacci numbers directly from a generating function, showing how an algebraic manipulation of a power series translates into a formula for the sequence's terms. The lecture then moves to generating functions in two variables, extending the single-variable machinery to problems that track two parameters at once. The style is chalkboard-based, working through the algebra step by step rather than relying on slides, consistent with MIT OpenCourseWare's standard lecture capture. Part of the Spring 2024 course sequence, this installment assumes familiarity with the basic definition and manipulation of generating functions from earlier lectures.