Waste less time on Facebook — follow Brilliant.

Derangements introduction

In this set we will try to find in how many ways can we arrange a set of different objects so that none of the objects go to their right place and try to derive a formula for it.

You may choose to read Principle of Inclusion and Exclusion

Note by Eddie The Head
2 years, 6 months ago

No vote yet
1 vote


Sort by:

Top Newest

Here is an easy proof of a formula for derangements click here Bogdan Simeonov · 2 years, 6 months ago

Log in to reply


Problem Loading...

Note Loading...

Set Loading...