A Short Combinatorial Proof of Derangement Identity
Abstract
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 point. We presents a short combinatorial proof for a weighted sum derangement identities.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.