document.write( "Question 1067974: Each person attending a party brings a prize. If there are n people and therefore n prizes, where anyone can get any number of prizes, how many ways can the prizes be distributed so that no one leaves with the prizes he/she brought?\r
\n" );
document.write( "\n" );
document.write( "(a) Solve this problem using inclusion/exclusion
\n" );
document.write( "(b) There is a much easier solution. What is it?
\n" );
document.write( "(c) Use binomial theorem to explain why both answers are the same. \n" );
document.write( "
Algebra.Com's Answer #683337 by ikleyn(52781)![]() ![]() You can put this solution on YOUR website! . \n" ); document.write( "See this Wikipedia article\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "https://en.wikipedia.org/wiki/Derangement\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "https://en.wikipedia.org/wiki/Derangement\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \n" ); document.write( " |