Derangements Formula

Lukas Bulwahn 📧

June 27, 2015

This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.

Abstract

The Derangements Formula describes the number of fixpoint-free permutations as a closed formula. This theorem is the 88th theorem in a list of the “Top 100 Mathematical Theorems”.

License

BSD License

Topics

Session Derangements

Cite

× 
@article{Derangements-AFP,
  author  = {Lukas Bulwahn},
  title   = {Derangements Formula},
  journal = {Archive of Formal Proofs},
  month   = {June},
  year    = {2015},
  note    = {\url{https://isa-afp.org/entries/Derangements.html},
             Formal proof development},
  ISSN    = {2150-914x},
}
Download

Download

× Download latest

Older releases: