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

The derangement numbers DnD_nDn​ count permutations with no fixed points and satisfy: 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=1,D1=0D_0 = 1, D_1 = 0D0​=1,D1​=0. Compute D4D_4D4​.