Jump to navigation Jump to search
- Recurrence Relation for Number of Derangements on Finite Set
- Closed Form for Number of Derangements on Finite Set
They solved it at around the same time.
The question is often couched in the idea of counting the number of ways of placing letters at random in envelopes such that nobody receives the correct letter.
- 2014: Christopher Clapham and James Nicholson: The Concise Oxford Dictionary of Mathematics (5th ed.) ... (previous) ... (next): Entry: derangement