Concepts2
∑MathAdvanced
Stirling Numbers of First Kind
Stirling numbers of the first kind count permutations by their number of cycles and connect power polynomials to rising/falling factorials.
#stirling numbers of the first kind#unsigned cycle numbers#signed stirling numbers+12
⚙️AlgorithmAdvanced
Polynomial Operations
Fast polynomial operations treat coefficients like numbers but use FFT/NTT to multiply in O(n \log n) time instead of O(n^2).
#polynomial#ntt#fft+12