Tag: formula

• Counting derangements

  First published April 21, 2019
  

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

Latest Posts

Post Tags

maths combinatorics recursion metric-geometry education admissions web-design turing-machines topology spreadsheets revision ramsey-theory ramsey-numbers quantum-computation modular-machines linear-algebra jekyll group-theory formula finances design derangements computability automata algorithm-theory algebra