Guichard-Combinatorics-Graph-Theory · Problem 1.8.8

Fundamentals

Mathematics — Probability · stirling-numbers

Problem

Prove: [nk]=∑i=k−1n−1(n−i−1)!(n−1i)[ik−1]\left[\begin{smallmatrix}n\\k\end{smallmatrix}\right] = \sum_{i=k-1}^{n-1} (n-i-1)! \binom{n-1}{i} \left[\begin{smallmatrix}i\\k-1\end{smallmatrix}\right].

Related theory

Browse the problem library