SOLUTION: Find the number of distinguishable permutations formed by using each of the letters ``AABCD'' once and only once
Algebra ->
Permutations
-> SOLUTION: Find the number of distinguishable permutations formed by using each of the letters ``AABCD'' once and only once
Log On
Question 598636: Find the number of distinguishable permutations formed by using each of the letters ``AABCD'' once and only once Answer by stanbon(75887) (Show Source):
You can put this solution on YOUR website! Find the number of distinguishable permutations formed by using each of the letters ``AABCD'' once and only once
---------------
Ans: 5!/2! = 5*4*3 = 60 permutations
=========================
Cheers,
Stan H.
=========================
(