Guest Session: 1 Question Remaining. Create Account to save progress.
Login
Recursionhard
0:00.0

The derangement DnD_nDn​ (permutations with no fixed points) satisfies Dn=(n−1)(Dn−1+Dn−2)D_n = (n-1)(D_{n-1} + D_{n-2})Dn​=(n−1)(Dn−1​+Dn−2​) with D0=1D_0 = 1D0​=1 and D1=0D_1 = 0D1​=0. What is D4D_4D4​?