SOLUTION: find the number of distinguishable permutations of the letters in word missouri

Algebra ->  Permutations -> SOLUTION: find the number of distinguishable permutations of the letters in word missouri      Log On


   



Question 1155407: find the number of distinguishable permutations of the letters in word missouri
Found 2 solutions by ikleyn, MathLover1:
Answer by ikleyn(52777) About Me  (Show Source):
You can put this solution on YOUR website!
.


The word "missouri" has 8 letters, of them letter "i" has a multiplicity of 2 and the letter "s" also has a multiplicity of 2.


Therefore, the number of all distinguishable permutations under the question is


    n = 8%21%2F%282%21%2A2%21%29 = %288%2A7%2A6%2A5%2A4%2A3%2A2%2A1%29%2F%282%2A2%29 = 10080.


Two factors  2!  in the denominator serve to account for multiplicities of the two letters, "i" and "s".

Solved.

----------------

To see many other similar solved problems, look into the lesson
    - Arranging elements of sets containing indistinguishable elements
in this site.

Also,  you have this free of charge online textbook in ALGEBRA-II in this site
    - ALGEBRA-II - YOUR ONLINE TEXTBOOK.

The referred lesson is the part of this online textbook under the topic  "Combinatorics: Combinations and permutations".


Save the link to this textbook together with its description

Free of charge online textbook in ALGEBRA-II
https://www.algebra.com/algebra/homework/complex/ALGEBRA-II-YOUR-ONLINE-TEXTBOOK.lesson

into your archive and use when it is needed.


Answer by MathLover1(20849) About Me  (Show Source):
You can put this solution on YOUR website!
Find the number of distinguishable permutations of the letters in the word
“Missouri"
Letter Frequency
M 1
I 2
S 2
U 1
R 1
O 1
Total 8
The value, calculated by hand is: