SOLVER7 Study. Nothing Else.
Exercise 6.3 Q10

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

Solution

👶 Simple Explanation

Simple Explanation

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\).

📖 Permutations of MISSISSIPPI with the Four I's Not Together

Detailed Explanation

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.

Formula Used

Distinct permutations \(= \frac{n!}{p!\,q!\,r!\cdots}\), and (I's not together) \(=\) (total arrangements) \(-\) (arrangements with all I's together).

Solution

  1. Step 1: Count the letters and their repetitions in MISSISSIPPI. Total letters \(= 11\). The letter M appears \(1\) time, I appears \(4\) times, S appears \(4\) times, and P appears \(2\) times.
  2. Step 2: Find the total number of distinct arrangements using the repetition formula: \[\frac{11!}{4!\,4!\,2!}\] Now compute: \(11! = 39916800\), \(4! = 24\), \(2! = 2\), so the denominator is \(24 \times 24 \times 2 = 1152\). \[\frac{39916800}{1152} = 34650\] So there are \(34650\) total arrangements.
  3. Step 3: Now count arrangements where all four I's come together. Treat the four I's as one single block. This block, together with the other letters M, S, S, S, S, P, P, gives us objects to arrange: the (IIII) block plus \(7\) other letters, making \(8\) items in total.
  4. Step 4: Among these \(8\) items, S repeats \(4\) times and P repeats \(2\) times, while M and the (IIII) block each appear once. The number of such arrangements is \[\frac{8!}{4!\,2!}\] Now compute: \(8! = 40320\), and \(4! \times 2! = 24 \times 2 = 48\). \[\frac{40320}{48} = 840\] So there are \(840\) arrangements with all I's together. (The four I's inside the block are identical, so they contribute no extra arrangements.)
  5. Step 5: Subtract to get the arrangements where the I's are NOT all together: \[34650 - 840 = 33810\]

Final Answer

The number of distinct permutations in which the four I's do not come together is \(33810\).

Common Mistake

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!\).

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: List every letter in MISSISSIPPI along with how many times it appears. Total letter count = 11. M appears 1 time, I appears 4 times, S appears 4 times, P appears 2 times. — Reason: Identifying repetitions is essential before applying the permutation formula for identical objects.
  2. Step 2: Apply the repeated-objects permutation formula to find the total number of distinct arrangements of all 11 letters: \[ \frac{11!}{4!\\, 4!\\, 2!} \] Compute each part: \( 11! = 39916800 \), \( 4! = 24 \), \( 2! = 2 \). The denominator is \( 24 \times 24 \times 2 = 1152 \). So the total is \[ \frac{39916800}{1152} = 34650 \] — Reason: This gives us the baseline count before imposing any restriction on the I's.
  3. Step 3: To count arrangements where all four I's are together, treat the four I's as one single block labelled (IIII). Now the items to arrange are: the block (IIII), M, S, S, S, S, P, P — that is 8 items in total, where S repeats 4 times and P repeats 2 times. — Reason: Bundling the four I's into one unit reduces the problem to arranging 8 objects, automatically keeping all I's adjacent.
  4. Step 4: Count the distinct arrangements of these 8 items using the same formula: \[ \frac{8!}{4!\\, 2!} \] Compute: \( 8! = 40320 \), \( 4! = 24 \), \( 2! = 2 \). The denominator is \( 24 \times 2 = 48 \). So the number of arrangements with all I's together is \[ \frac{40320}{48} = 840 \] — Reason: This is the count we need to subtract to eliminate all cases where the I's cluster together.
  5. Step 5: Apply complementary counting: subtract the restricted count from the total. \[ 34650 - 840 = 33810 \] — Reason: Every arrangement that does NOT have all four I's together is exactly what remains after removing the unwanted group, giving us the final answer.

Final Answer

The number of distinct permutations in which the four I's do not come together is \(33810\).

Common Mistake

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.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Total distinct arrangements of MISSISSIPPI: Letters: M×1, I×4, S×4, P×2; total = 11. Total arrangements: \[\frac{11!}{4!\\,4!\\,2!} = \frac{39916800}{24 \times 24 \times 2} = \frac{39916800}{1152} = 34650\]
  2. Step 2: Arrangements with all four I's together: Treat (IIII) as one block; arrange 8 objects: (IIII), M, S, S, S, S, P, P with S×4 and P×2. \[\frac{8!}{4!\\,2!} = \frac{40320}{24 \times 2} = \frac{40320}{48} = 840\]
  3. Step 3: Subtract: Arrangements with I's NOT together: \[34650 - 840 = 33810\]

Answer: The number of distinct permutations in which the four I's do not come together is \(33810\).

➕ More Examples

More Examples

Example 1

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

Example 2

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

🎯 Try a Similar Question

Try a Similar Question

Question: In how many of the distinct permutations of the letters in the word STATISTICS do the three S's not come together?

Solution

  1. Step 1: Identify the letters and their frequencies: The word STATISTICS has 10 letters. Let us count each letter: S appears 3 times, T appears 3 times, A appears 1 time, I appears 2 times, C appears 1 time. Total letters = 10.
  2. Step 2: Find the total number of distinct permutations: The total number of distinct permutations of the 10 letters of STATISTICS is \[ \frac{10!}{3! \cdot 3! \cdot 1! \cdot 2! \cdot 1!} \] Calculating step by step: \[ 10! = 3628800 \] and the denominator is \[ 3! \cdot 3! \cdot 2! = 6 \times 6 \times 2 = 72 \] So the total is \[ \frac{3628800}{72} = 50400 \]
  3. Step 3: Find the number of permutations where all three S's come together: Treat the three S's as a single block SSS. Now we have 8 objects to arrange: (SSS), T, T, T, A, I, I, C. The number of distinct arrangements of these 8 objects is \[ \frac{8!}{3! \cdot 1! \cdot 2! \cdot 1!} \] Here 8! = 40320, and the denominator accounts for 3 T's and 2 I's: \[ 3! \cdot 2! = 6 \times 2 = 12 \] So the number of arrangements where all three S's are together is \[ \frac{40320}{12} = 3360 \]
  4. Step 4: Apply the complementary counting principle: The number of distinct permutations in which the three S's do NOT all come together is \[ 50400 - 3360 = 47040 \]

Answer: The number of distinct permutations of the letters in STATISTICS in which the three S's do not all come together is \( 47040 \).

Everything you get with Solver7

More questions in Permutations and Combinations