How many different words can be formed by jumbling letters in word MISSISSIPPI in which no two S are

English

Gujarati

Hindi

6.Permutation and Combination

hard

How many different words can be formed by jumbling the letters in the word $MISSISSIPPI$ in which no two $S$ are adjacent $?$

$8.^6C_4$

$6.7. ^8C_4$

$6.8. ^7C_4$

$7. ^6C_4. ^8C_4$

(AIEEE-2008)

Solution

Given wird is $MISSISSIPPI$
Here $I=4$ times, $5-4$ times, $P-2$ times, $M=1$ time
$\because$ Required number of words $=8 C_{4} \times \frac{7 !}{4 ! 2 !}$
$\Rightarrow 8 C_{4} \times \frac{7 \times 6 !}{4 ! 2 !}$
$\Rightarrow 7.8 C_{4} .6 C_{4}$

Standard 11

Mathematics

If $\frac{{{}^{n + 2}{C_6}}}{{{}^{n – 2}{P_2}}} = 11$, then $n$ satisfies the equation

hard

(JEE MAIN-2016)

There are three bags $B_1$,$B_2$ and $B_3$ containing $2$ Red and $3$ White, $5$ Red and $5$ White, $3$ Red and $2$ White balls respectively. A ball is drawn from bag $B_1$ and placed in bag $B_2$, then a ball is drawn from bag $B_2$ and placed in bag $B_3$, then a ball is drawn from bag $B_3$. The number of ways in which this process can be completed, if same colour balls are used in first and second transfers (Assume all balls to be different) is

normal

The number of ways five alphabets can be chosen from the alphabets of the word $MATHEMATICS$, where the chosen alphabets are not necessarily distinct, is equal to :

hard

(JEE MAIN-2024)

$\left( {\begin{array}{{20}{c}}n\\{n – r}\end{array}} \right)\, + \,\left( {\begin{array}{{20}{c}}n\\{r + 1}\end{array}} \right)$, whenever $0 \le r \le n – 1$is equal to

normal

If $n$ is even and the value of $^n{C_r}$ is maximum, then $r = $

normal

How many different words can be formed by jumbling the letters in the word $MISSISSIPPI$ in which no two $S$ are adjacent $?$

Solution

Similar Questions

If $\frac{{{}^{n + 2}{C_6}}}{{{}^{n – 2}{P_2}}} = 11$, then $n$ satisfies the equation

The number of ways five alphabets can be chosen from the alphabets of the word $MATHEMATICS$, where the chosen alphabets are not necessarily distinct, is equal to :

$\left( {\begin{array}{*{20}{c}}n\\{n – r}\end{array}} \right)\, + \,\left( {\begin{array}{*{20}{c}}n\\{r + 1}\end{array}} \right)$, whenever $0 \le r \le n – 1$is equal to

If $n$ is even and the value of $^n{C_r}$ is maximum, then $r = $

Start a Free Trial Now

$\left( {\begin{array}{{20}{c}}n\\{n – r}\end{array}} \right)\, + \,\left( {\begin{array}{{20}{c}}n\\{r + 1}\end{array}} \right)$, whenever $0 \le r \le n – 1$is equal to