Is there any simple derivation for the number of derangements of n objects?
I have the problem - the number of ways in which n men can collect their n coats,with no man getting his own coat. I’ve started with $n! -$ (greater than or equal to one man gets his own coat). But I have difficulty understanding where things are being over-counted.