In how many of the distinct permutations of the letters in \(MISSISSIPPI\) do the four I’s not come together \(?\)
CBSE Class 11 Maths · Permutations and Combinations
CBSE Class 11 Maths · Permutations and Combinations
Imagine you have letter tiles spelling MISSISSIPPI and you want to arrange them in a row. Some tiles are the same, like having four I tiles. We want to count arrangements where the four I tiles are NOT all huddled together. A clever trick helps here: count every possible arrangement, then subtract the ones where all four I tiles are stuck side by side like a group. What remains are all the arrangements where the I tiles are spread apart. That leftover count turns out to be 33810.
Answer: The number of distinct permutations in which the four I's do not come together is \(33810\).
The word MISSISSIPPI has 11 letters, but many letters repeat. When some objects are identical, the number of distinct permutations of \(n\) objects, where one kind repeats \(p\) times, another repeats \(q\) times, and so on, is given by \(\frac{n!}{p!\,q!\,r!}\). To find how many arrangements have the four I's NOT together, it is easiest to use the complement idea: first count the total arrangements, then subtract the arrangements where all four I's DO come together. When we want a group of letters together, we treat that whole group as a single block and arrange it along with the remaining letters.
Distinct permutations \(= \frac{n!}{p!\,q!\,r!\cdots}\), and (I's not together) \(=\) (total arrangements) \(-\) (arrangements with all I's together).
The number of distinct permutations in which the four I's do not come together is \(33810\).
A common mistake is to multiply the 'I's together' count by \(4!\) for arranging the I's inside the block. Since all four I's are identical, arranging them among themselves gives no new distinct words, so we do NOT multiply by \(4!\).
The number of distinct permutations in which the four I's do not come together is \(33810\).
One common mistake: students forget to account for the repeated S's and P's when arranging the block along with the remaining letters in Step 4, and instead use simply \( 8! \) without dividing by \( 4!\\, 2! \), which overcounts those arrangements significantly.
Answer: The number of distinct permutations in which the four I's do not come together is \(33810\).
Question: In how many of the distinct permutations of the letters in the word BANANA do the three A's not come together?
Solution: The word BANANA has 6 letters: B(1), A(3), N(2). Step 1: Find the total number of distinct permutations of BANANA. \[\text{Total} = \frac{6!}{3! \cdot 2!} = \frac{720}{6 \cdot 2} = 60\] Step 2: Find the number of permutations where all three A's come together. Treat the three A's as a single unit (AAA). Now we have 4 units: (AAA), B, N, N. \[\text{Arrangements with A's together} = \frac{4!}{2!} = \frac{24}{2} = 12\] Step 3: Subtract to find arrangements where the three A's do NOT come together. \[\text{Required} = 60 - 12 = 48\]
Answer: 48
Question: In how many of the distinct permutations of the letters in the word ARRANGEMENT do the two R's not come together?
Solution: The word ARRANGEMENT has 11 letters: A(2), R(2), N(2), G(1), E(2), M(1), T(1). Let us first verify the letter count: A-R-R-A-N-G-E-M-E-N-T gives A(2), R(2), N(2), G(1), E(2), M(1), T(1). Total = 2+2+2+1+2+1+1 = 11. Correct. Step 1: Find the total number of distinct permutations of ARRANGEMENT. \[\text{Total} = \frac{11!}{2! \cdot 2! \cdot 2! \cdot 2!}\] Calculating: \[11! = 39916800\] \[2! \cdot 2! \cdot 2! \cdot 2! = 2 \times 2 \times 2 \times 2 = 16\] \[\text{Total} = \frac{39916800}{16} = 2494800\] Step 2: Find the number of permutations where both R's come together. Treat (RR) as a single unit. Now we have 10 units with repetitions: (RR), A(2), N(2), G(1), E(2), M(1), T(1). \[\text{Arrangements with R's together} = \frac{10!}{2! \cdot 2! \cdot 2!}\] \[10! = 3628800\] \[2! \cdot 2! \cdot 2! = 8\] \[\text{Arrangements with R's together} = \frac{3628800}{8} = 453600\] Step 3: Subtract to find arrangements where the two R's do NOT come together. \[\text{Required} = 2494800 - 453600 = 2041200\]
Answer: 2041200
Question: In how many of the distinct permutations of the letters in the word STATISTICS do the three S's not come together?
Answer: The number of distinct permutations of the letters in STATISTICS in which the three S's do not all come together is \( 47040 \).