Guichard-Combinatorics-Graph-Theory · Problem 2.2.7

Inclusion-Exclusion

Mathematics — Probability · derangements-combinatorial-identity

Problem

Give a combinatorial proof that n!=∑k=0n(nk)Dn−k.n! = \sum_{k=0}^{n} \binom{n}{k} D_{n-k}.

Browse the problem library