Guichard-Combinatorics-Graph-Theory · Problem 1.8.9

Fundamentals

Mathematics — Probability · stirling-numbers

Problem

Use the previous exercise to prove s(n,k)=∑i=k−1n−1(−1)n−i−1(n−i−1)!(n−1i)s(i,k−1)s(n,k) = \sum_{i=k-1}^{n-1} (-1)^{n-i-1}(n-i-1)! \binom{n-1}{i} s(i,k-1).

Related theory

Browse the problem library