A) \[n!-(n-2)!\]
B) \[(n-2)!(n-2)\]
C) \[n!-2(n-1)\]
D) \[(n-2)n!\]
Correct Answer: B
Solution :
[b]: Total number of arrangements of n books = n!. If two specified books always together then number of ways \[=(n-1)!\times 2\] Hence required number of ways \[=n!-(n-1)!\times 2\] \[=n(n-1)!-(n-1)!\times 2=(n-1)!(n-2)\].You need to login to perform this action.
You will be redirected in
3 sec