MathCastle
Counting & ProbabilityHardInclusion–Exclusion, Derangements & Pigeonhole

Inclusion--Exclusion, Derangements & Pigeonhole · Hard problem

Compute the number of derangements of 66 objects (permutations of {1,2,3,4,5,6}\{1,2,3,4,5,6\} with no fixed point).