Tag: derangements

  • Counting Derangements


    I present an inefficient yet novel way of recursively counting derangements of a set, and generalise this to counting permutations without short cycles.