What is the number of permutations of {1,2,3,...,n} in
which 1 is not in the first? position
OPTIONS
a.
n!-(n-1)!
b
.
(n-1)!-n
C.
n!-(n-1)
O d.
(n-1)!-n!
Answers
Answered by
0
Answer:
so required permutations= n!-(n-1)!
a. n!-(n-1)!
Step-by-step explanation:
What is the number of permutations of {1,2,3,...,n} in
which 1 is not in the first? position
OPTIONS
no permutation having 1 in Ist position is (n-1)!
total permutations= n!
so required permutations= n!-(n-1)!
so required permutations= n!-(n-1)!a. n!-(n-1)!
Similar questions