| Home |
| About |
| Submission |
| Updating Entries |
| Using Entries |
| Search |
| Statistics |
| Index |
| Download |
Derangements Formula
| Title: | Derangements Formula |
| Author: | Lukas Bulwahn (lukas /dot/ bulwahn /at/ gmail /dot/ com) |
| Submission date: | 2015-06-27 |
| 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''. |
| BibTeX: |
@article{Derangements-AFP,
author = {Lukas Bulwahn},
title = {Derangements Formula},
journal = {Archive of Formal Proofs},
month = jun,
year = 2015,
note = {\url{http://isa-afp.org/entries/Derangements.html},
Formal proof development},
ISSN = {2150-914x},
}
|
| License: | BSD License |
| Status: [ok] | This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations. |
|
Proof outline Proof document |
| Browse theories |
| Download this entry |