A short combinatorial proof of derangement identity (Q1636937)

A fixed point of a permutation \(\sigma\in S_n\) is an symbol \(k\in \{1,2,\dots n\}\) such that \(\sigma(k)=k\). A permutation having no fixed point is called a \textit{derangement}. The number of derangements of the set \(\{1,2,\dots,n\}\) is denoted by \(D_n\). The number of permutations \(\sigma \in S_n\) having exactly \(r\) fixed points is called \(r\)-\textit{rencontres number} and it is denoted by \(D_n(r)\). In particular one has \(D_n = D_n(0)\). In this paper, the authors consider several known combinatorial identities for the number of derangements and prove new identities for the rencontres numbers.