Question

How many different permutations are possible using all the letters of the words $MISSISSIPPI$,if no two $I^{\prime }s$ are together ?

Answer 1

Consider the given word ‘’MISSIPPI’’.

In the last post we discovered that we can find the number of unique permutations by using the Fundamental theorem of counting.

Since, MISSISSIPPI has 11 letters, draw eleven lines and fill each in with the number of available letter choices, e.g. 11 options for the first, 10 for the second, and so on…

$11\times 10\times 9\times 8\times 7\times 6\times 5\times 4\times 3\times 2\times 1$ $=39916800$

Hence, this is the answer.