Permutations on word $MISSISSIPPI$.

combinatorics permutations

Solution 1:

$$ \frac{11!}{4!4!2!} -1 $$

since $\frac{11!}{4!4!2!}$ is the total number of permutations of the letters from the word MISSISSIPPI.

Since, the word itself is not a rearrangement of itself, that's why a "-1"

Related

Show that $\sqrt{1+n(n+1)(n+2)(n+3)}$ is a whole number for all whole numbers $n$.
Prove the Recursion Theorem
For an outer measure $m^*$, does $m^*(E\cup A)+m^*(E\cap A) = m^*(E)+m^*(A)$ always hold?
$(S^1 \times [0,1])/\sim$ homeomorphic to unit disk $ D^2$
How does one derive these solutions to the cubic equation?
Proof that the series expansion for exp(1) is a Cauchy sequence
Example of Erdos-Szekeres bound being tight
For every $n\ge3$ there exists $n$ different integers $a_1,...,a_n$ so that $\frac{1}{a_1}+\frac{1}{a_2}+...+\frac{1}{a_n}=1$
Find a set of limit point of $A=\{ \frac{1}{m}+\frac{1}{n} : m,n \in \Bbb{N} \}$ in $\Bbb{R}$ by using the following way.
Show that Statistic is complete
number of distinct solution of Integral equation
Equation of line in form of determinant