SOLVER7 Study. Nothing Else.
Miscellaneous Exercise Chapter 6 Q11

In how many ways can the letters of the word \(ASSASSINATION\) be arranged so that all the S's are together \(?\)

CBSE Class 11 Maths · Permutations and Combinations

Solution

👶 Simple Explanation

Simple Explanation

Imagine the word ASSASSINATION as a row of letter tiles. Some tiles are the same, like four S tiles. Now, glue all four S tiles into one big block. That block acts like a single tile. Count the remaining tiles plus the block — that gives 10 items to arrange. Because some tiles still repeat, we divide to avoid counting the same arrangement twice. The total number of ways to line them all up comes out to \( 151200 \).

Answer: The number of arrangements in which all the S's are together is \( 151200 \).

📖 Arranging ASSASSINATION with all S's Together

Detailed Explanation

The word ASSASSINATION has 13 letters, but some letters repeat. When we arrange letters that are not all distinct, we use the permutation formula for a multiset, which divides by the factorials of the counts of each repeated letter. The special condition here is that all the S's must stay together. To handle a 'together' condition, we treat the group of S's as a single block. This reduces the number of separate items to arrange. Since the block contains identical S's, arranging them among themselves gives nothing new, so the block counts as one unit. After forming the block, we arrange the block along with the remaining letters, again dividing by the factorials of any letters that still repeat.

Formula Used

Number of arrangements of n objects where a letter repeats \( p \) times, another repeats \( q \) times, etc. is \[ \frac{n!}{p!\, q!\, \cdots} \]

Solution

  1. Step 1: Count the letters of ASSASSINATION. The word has 13 letters: A, S, S, A, S, S, I, N, A, T, I, O, N. Counting each: A appears 3 times, S appears 4 times, I appears 2 times, N appears 2 times, and T, O appear once each.
  2. Step 2: Apply the 'together' condition. Since all 4 S's must stay together, tie them into one single block: (SSSS). Because all four S's are identical, arranging them inside the block gives only 1 distinct arrangement.
  3. Step 3: Count the objects to arrange now. Remove the 4 S's and replace them with 1 block. The remaining letters are A, A, A, I, I, N, N, T, O, which is 9 letters, plus the 1 S-block. So we arrange \( 9 + 1 = 10 \) objects in a row.
  4. Step 4: Identify the repetitions among these 10 objects. Here A repeats 3 times, I repeats 2 times, N repeats 2 times. The block, T, and O are single objects. So we must divide by \( 3! \) for the A's, \( 2! \) for the I's, and \( 2! \) for the N's.
  5. Step 5: Write the arrangement count using the multiset permutation formula: \[ \frac{10!}{3!\, 2!\, 2!} \]
  6. Step 6: Evaluate. We know \( 10! = 3628800 \), \( 3! = 6 \), and \( 2! = 2 \). The denominator is \( 6 \times 2 \times 2 = 24 \). So \[ \frac{3628800}{24} = 151200 \]

Final Answer

The number of arrangements in which all the S's are together is \( 151200 \).

Common Mistake

A common mistake is to multiply by \( 4! \) for arranging the S's inside the block. Since all four S's are identical, they can be arranged in only one distinct way, so we must NOT multiply by \( 4! \).

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Write out all the letters of ASSASSINATION and count each one. The word contains 13 letters in total. Tallying each letter: A appears \( 3 \) times, S appears \( 4 \) times, I appears \( 2 \) times, N appears \( 2 \) times, and T and O each appear \( 1 \) time. — Reason: Knowing the exact frequency of every letter is essential before applying the multiset permutation formula.
  2. Step 2: Bundle all four S's into a single unit, written as \( (SSSS) \). Since the four S's are identical, there is only \( 1 \) distinct internal arrangement of this block. — Reason: The 'all S's together' condition is handled by replacing multiple identical letters with one block, which we then treat as a single object in the arrangement.
  3. Step 3: Count the objects that now need to be arranged. We have the block \( (SSSS) \) plus the remaining 9 letters: A, A, A, I, I, N, N, T, O. That gives a total of \( 9 + 1 = 10 \) objects to arrange. — Reason: Replacing the 4 individual S's with 1 block reduces the pool from 13 items to 10 items, which is what we actually permute.
  4. Step 4: Identify which of the 10 objects still repeat. Among the 10 objects: A repeats \( 3 \) times, I repeats \( 2 \) times, N repeats \( 2 \) times, and the block \( (SSSS) \), T, and O each appear exactly once. — Reason: Any repeated items must be accounted for in the denominator of the permutation formula to avoid over-counting identical arrangements.
  5. Step 5: Apply the multiset permutation formula with \( n = 10 \), dividing by \( 3! \) for the A's, \( 2! \) for the I's, and \( 2! \) for the N's: \[ \frac{10!}{3!\, 2!\, 2!} \] — Reason: This formula counts every distinguishable ordering of the 10 objects while correcting for repetitions.
  6. Step 6: Compute the value step by step. First, \( 10! = 3628800 \). Then the denominator: \( 3! = 6 \), \( 2! = 2 \), \( 2! = 2 \), so \( 3! \times 2! \times 2! = 6 \times 2 \times 2 = 24 \). Therefore: \[ \frac{3628800}{24} = 151200 \] — Reason: Carrying out the arithmetic gives the final count of valid arrangements.

Final Answer

The number of arrangements in which all the S's are together is \( 151200 \).

Common Mistake

One common mistake: forgetting to divide by \( 2! \times 2! \) for the repeated I's and N's after forming the S-block, which leads to an inflated answer of \( 302400 \) instead of \( 151200 \).

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: ASSASSINATION has 13 letters: A – 3 times, S – 4 times, I – 2 times, N – 2 times, T – 1 time, O – 1 time.
  2. Step 2: Treat all 4 S’s as one block (SSSS). Total items to arrange: 1 block + A, A, A, I, I, N, N, T, O = 10 items.
  3. Step 3: Number of arrangements: \[\frac{10!}{3! \cdot 2! \cdot 2!} = \frac{3628800}{6 \cdot 2 \cdot 2} = \frac{3628800}{24} = 151200\]

Answer: The number of arrangements in which all the S's are together is \( 151200 \).

➕ More Examples

More Examples

Example 1

Question: In how many ways can the letters of the word MISSISSIPPI be arranged so that all the P's are together?

Solution: Step 1: Identify the letters in MISSISSIPPI. The word MISSISSIPPI has 11 letters with the following frequencies: M appears 1 time, I appears 4 times, S appears 4 times, P appears 2 times. Step 2: Treat all P's as a single unit. Since both P's must stay together, bundle them into one unit: (PP). Now we have the following letters to arrange: (PP), M, I, I, I, I, S, S, S, S — a total of 10 units. Step 3: Count the arrangements of these 10 units. Among these 10 units, I repeats 4 times and S repeats 4 times. So the number of distinct arrangements is \[\frac{10!}{4! \times 4!}\] Step 4: Compute the value. \[10! = 3628800\] \[4! = 24\] Therefore, \[\frac{3628800}{24 \times 24} = \frac{3628800}{576} = 6300\] Step 5: Since the two P's inside the bundle are identical, there is only 1 way to arrange them internally, so no additional factor is needed. Hence, the total number of arrangements is 6300.

Answer: 6300

Example 2

Question: In how many ways can the letters of the word CONJUNCTION be arranged so that all the N's are together?

Solution: Step 1: Identify the letters in CONJUNCTION. The word CONJUNCTION has 11 letters: C, O, N, J, U, N, C, T, I, O, N. The frequencies are: C appears 2 times, O appears 2 times, N appears 3 times, J appears 1 time, U appears 1 time, T appears 1 time, I appears 1 time. Step 2: Treat all N's as a single unit. Bundle the three N's into one unit: (NNN). Now we arrange the following units: (NNN), C, C, O, O, J, U, T, I — a total of 9 units. Step 3: Count the arrangements of these 9 units. Among these 9 units, C repeats 2 times and O repeats 2 times. So the number of distinct arrangements is \[\frac{9!}{2! \times 2!}\] Step 4: Compute the value. \[9! = 362880\] \[2! = 2\] Therefore, \[\frac{362880}{2 \times 2} = \frac{362880}{4} = 90720\] Step 5: Since the three N's inside the bundle are identical, there is only 1 way to arrange them internally, contributing no extra factor. Hence, the total number of arrangements is 90720.

Answer: 90720

🎯 Try a Similar Question

Try a Similar Question

Question: In how many ways can the letters of the word Mississippi be arranged so that all the P's are together?

Solution

  1. Step 1: Identify the letters in MISSISSIPPI: The word MISSISSIPPI has 11 letters with the following frequencies: M appears 1 time, I appears 4 times, S appears 4 times, P appears 2 times.
  2. Step 2: Treat all P's as a single unit: Since both P's must be together, we bundle PP into one single unit. This unit along with the remaining letters gives us the collection: \( \{PP\,\text{-unit},\, M,\, I,\, I,\, I,\, I,\, S,\, S,\, S,\, S\} \), which is a total of \( 10 \) objects.
  3. Step 3: Count repeated letters in the reduced collection: In these 10 objects, I appears 4 times and S appears 4 times. The PP-unit and M each appear once.
  4. Step 4: Apply the formula for arrangements with repetitions: The number of distinct arrangements of these 10 objects is: \[ \frac{10!}{4! \times 4!} \]
  5. Step 5: Calculate the value: We compute step by step. First, \( 10! = 3628800 \), and \( 4! = 24 \), so \( 4! \times 4! = 24 \times 24 = 576 \). Therefore the number of arrangements is \[ \frac{3628800}{576} = 6300 \]
  6. Step 6: Internal arrangement of the PP-unit: Since both P's are identical, the internal arrangement of the PP-unit contributes only \( \dfrac{2!}{2!} = 1 \) way. No additional multiplication is needed.
  7. Step 7: State the final answer: The total number of arrangements of the letters of MISSISSIPPI with all P's together is \( 6300 \).

Answer: The number of arrangements in which all the P's are together is \( 6300 \).

Everything you get with Solver7

More questions in Permutations and Combinations