The following is the question I am trying to solve.
There are six students each having a different gift. How many different ways can these students exchange gifts so that none of them get their own gift ?
I've tried with 1, 2 ,3 and 4 students to get 0,1,2 and 9 ways but I cannot see a pattern. Can I have some help with the general case n ?
