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
CBSE Class 11 Maths · Permutations and Combinations
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 \).
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.
Number of arrangements of n objects where a letter repeats \( p \) times, another repeats \( q \) times, etc. is \[ \frac{n!}{p!\, q!\, \cdots} \]
The number of arrangements in which all the S's are together is \( 151200 \).
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! \).
The number of arrangements in which all the S's are together is \( 151200 \).
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 \).
Answer: The number of arrangements in which all the S's are together is \( 151200 \).
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
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
Question: In how many ways can the letters of the word Mississippi be arranged so that all the P's are together?
Answer: The number of arrangements in which all the P's are together is \( 6300 \).