A recursive approach (which is what I would use) would involve breaking the problem into isomorphic subproblems: to find all permutations of a string, find all permutations of the string without a ...
We present a proof that the expected number of fixed points in a permutation is 1. The proof uses an unusual recursive formula for the number of derangements instead of the usual approaches with ...