.
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 = = = 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.