Formal power series
Named by 2 essays across 2 fields — each of them below, with the objects they name alongside it.
A polynomial that counts
Hang a counting sequence on the powers of a variable and the two ways of combining choices — this and that, this or that — become multiplication and addition, so a recursion turns into an equation and the equation can be solved.
Every partition, hidden in a product
Multiply out one factor for each part size and the coefficient of q to the n is the number of partitions of n. Nothing is being approximated: the product is a bookkeeping device that does the counting by multiplying.
Named alongside it
The objects these essays reach for when they reach for this one.
Counting two waysGenerating functionPartitionAlgebraic identityBijectionBinomial coefficientCatalan numbersCoefficientConvolutionGeometric seriesProductRecurrence relation