Ask your own question, for FREE!
Mathematics 8 Online
OpenStudy (anonymous):

Sarah, Victor, Janel, and Kirby checked their coats at the door of the Colonnade Room Restaurant. The coat checker is in quite a hurry when he returns with their coats. How many different ways can their coats be returned so that no one recieves the right coat.? (please show your work.)

OpenStudy (anonymous):

disjunctions or something, i forget there is a formula for it, but in this case it is easier just to count say the correct order is SVJK then count the ways for no letter to be in the same order VSLK VKSL VKLS etc

OpenStudy (anonymous):

de arrangements, that is it!

OpenStudy (anonymous):

thanks

jimthompson5910 (jim_thompson5910):

you mean derangement http://mathworld.wolfram.com/Derangement.html

jimthompson5910 (jim_thompson5910):

this page probably has an easier formula to work with http://en.wikipedia.org/wiki/Derangement

OpenStudy (anonymous):

yeah, something like that really in this case it might be easiest to list all 24 and then point to the (cough 9) that fit the bill

OpenStudy (anonymous):

could someone list all the possibilities?

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!