retagged by
4,762 views

1 Answer

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 

edited

Related questions

2 votes
2 votes
4 answers
1
jaydip74 asked Jul 22, 2023
492 views
In how many ways can 3 non-negative integers be chosen such that a + b + c = 10 where a >= -1 , b >= -5 and c >= 3 ? 3666105None
0 votes
0 votes
2 answers
2
Lakshman Bhaiya asked Oct 30, 2018
1,736 views
9 different books are to be arranged on a bookshelf. 4 of these books were written by Shakespeare, 2 by Dickens, and 3 by Conrad. How many possible permutations are there...
3 votes
3 votes
1 answer
4
hacker16 asked Jan 22, 2018
855 views
in how many ways 2 alike apple, 3 alike orange and 4 alike mango can be given to 3 children if each child can have none or 1 or more than 1 fruits.