6 students were doing a small exam. Afterwards, they exchanged papers with each other to mark. The teacher said: " Don't cheat, you can't mark your own exam!" How many ways are there for the students to exchange their papers? (Assume the students are honest and they don't mark their own papers)
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Relevant wiki: Derangements
This is a derangement problem, the formula for the number of derangements is D n = n ! i = 0 ∑ n i ! ( − 1 ) i
Set n = 6 , we get D 6 = 6 ! ( 0 ! 1 − 1 ! 1 + 2 ! 1 − 3 ! 1 + 4 ! 1 − 5 ! 1 + 6 ! 1 ) = 2 6 5