A Short Combinatorial Proof of Derangement Identity

Ivica Martinjak, Dajana Stanić

The $n$-th rencontres number with the parameter $r$ is the number of permutations having exactly $r$ fixed points. In particular, a derangement is a permutation without any fixed p…