Combinatorics and Graph Theory · Problem 1.8.7

Fundamentals — David Guichard

Mathematics — Combinatorics · stirling-numbers-second-kind

Problem

Prove: S(n,k)=∑i=k−1n−1(n−1i)S(i,k−1)S(n,k) = \displaystyle\sum_{i=k-1}^{n-1} \binom{n-1}{i} S(i, k-1).

Related theory

Browse the problem library