SOLUTION: How many distinguishable permutations are there of the letters in WOODCOCK?

Algebra ->  Probability-and-statistics -> SOLUTION: How many distinguishable permutations are there of the letters in WOODCOCK?      Log On


   



Question 1152093: How many distinguishable permutations are there of the letters in WOODCOCK?
Answer by ikleyn(52835) About Me  (Show Source):
You can put this solution on YOUR website!
.

The word "WOODCOCK" has 8 letters.


Of them, letter "O" has the multiplicity of 3;

         letter "C" has the multiplicity of 2;

         the rest of the letters are unique.


Therefore, the number of all distinguishable permutations (they are also called "distinguishable arrangements") is


      8%21%2F%283%21%2A2%21%29 = %281%2A2%2A3%2A4%2A5%2A6%2A7%2A8%29%2F%28%281%2A2%2A3%29%2A%281%2A2%29%29 = 3360.    ANSWER


8! counts the number of all possible permutations of 8 letters.


3! in the denominator stays to account for repeating letter "O".


2! in the denominator stays to account for repeating letter "C".

Solved, answered and explained.