Prove that An=n!, the number of permutations of n elements, and Dn, the number of permutations of n elements without fixed points, satisfy the recursive equation: Dn = (n−1)(Dn−1 + Dn−2).
I've gotten to prove that Dn satifies such recurrence. I need help showing that n! satifies it.