3 votes 3 votes Combinatory combinatory + – Vikrant Singh asked Feb 1, 2015 • retagged Jun 27, 2017 by Arjun Vikrant Singh 4.8k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 5 votes 5 votes Solution: B This problem is a special case of permutiation called Dearrangement. where the permutation dose have any element occur in their original place. so D(n)=265 , dearrangement(n) = therefore , D(6) = ref@ http://math.stackexchange.com/questions/83380/i-have-a-problem-understanding-the-proof-of-rencontres-numbers-derangements/83472#83472 Gowthaman Arumugam answered Feb 2, 2015 • edited Jul 22, 2015 Gowthaman Arumugam comment Share Follow See all 2 Comments See all 2 2 Comments reply HarshaAgrawal commented Feb 2, 2015 reply Follow Share Explain it. 0 votes 0 votes Gowthaman Arumugam commented Feb 2, 2015 reply Follow Share Dearrangement is a special case of permutation where no element appereares in its original place. For derivation of the general formula for dearrangement refer the link that I have posted 0 votes 0 votes Please log in or register to add a comment.