Finding Number Of Derangement

40 Views Asked by At

$$n!=\sum_{i=0}^n\binom ni(!(n-i))$$ Hi. I am trying to review Discrete Math 1 for the new term. I couldn't find a proper strategy to prove this statement. What would be the best way to prove such a question using equality?

1

There are 1 best solutions below

0
On BEST ANSWER

The number of arrangements of $(1,\dots,n)$ such that exactly $i$ elements are not moved equals $$\binom{n}{i}(!(n-i))$$

A summation of these terms gives all $n!$ arrangements.