Find the number of different \(8\)-letter arrangements that can be made from the letters of the word \(DAUGHTER\) so that all vowels occur together
CBSE Class 11 Maths · Permutations and Combinations
CBSE Class 11 Maths · Permutations and Combinations
Imagine you have 8 friends standing in a row, but 3 of them — let's call them the vowel friends — always want to hold hands and stay together. So you tie those 3 friends into one group. Now you have 6 groups to arrange in a row. That gives 720 different orders. But inside the hand-holding group, the 3 friends can swap places in 6 ways. Multiply 720 by 6 and you get 4320 total arrangements.
Answer: The number of 8-letter arrangements of DAUGHTER with all vowels together is \( 6! \times 3! = 4320 \).
The word DAUGHTER has 8 distinct letters. Among these, the vowels are A, U, E and the consonants are D, G, H, T, R. The condition says all vowels must occur together. The key idea is: when certain items must always be together, we treat them as a single block (bundle). We first arrange this block along with the remaining separate items, and then separately arrange the items inside the block. Finally, by the fundamental principle of counting, we multiply these two arrangement counts. Since all letters here are distinct, no division for repetition is needed.
Number of arrangements of \( n \) distinct objects \( = n! \). By the fundamental principle of counting, total arrangements \( = (\text{arrangements of blocks}) \times (\text{arrangements inside the block}) \).
The number of 8-letter arrangements of DAUGHTER with all vowels together is \( 6! \times 3! = 4320 \).
A common mistake is to forget to arrange the vowels among themselves inside the block, giving only \( 6! = 720 \). You must also multiply by \( 3! \) because A, U, E can be ordered in different ways within the block.
The number of 8-letter arrangements of DAUGHTER with all vowels together is \( 6! \times 3! = 4320 \).
One common mistake: students forget to multiply by \( 3! \) for the internal arrangements of the vowels inside the block — they only compute \( 6! = 720 \) and miss the factor of 6 that comes from rearranging A, U, E among themselves.
Answer: The number of 8-letter arrangements of DAUGHTER with all vowels together is \( 6! \times 3! = 4320 \).
Question: Find the number of different 9-letter arrangements that can be made from the letters of the word MOUNTAINS so that all the vowels always occur together.
Solution: Step 1: Identify the letters in MOUNTAINS. The letters are: M, O, U, N, T, A, I, N, S — a total of 9 letters. Note that the letter N repeats twice. Step 2: Identify the vowels and consonants. Vowels: O, U, A, I (4 vowels, all distinct) Consonants: M, N, T, N, S (5 consonants, with N repeated twice) Step 3: Treat all vowels as a single block. We now have the block (OUAI) plus the 5 consonants M, N, T, N, S — giving us 6 units in total, with N repeated twice. Step 4: Count arrangements of the 6 units. The number of ways to arrange these 6 units (with N repeated twice) is: \[\frac{6!}{2!}\] Calculating: \[\frac{6!}{2!} = \frac{720}{2} = 360\] Step 5: Count arrangements within the vowel block. The 4 vowels O, U, A, I are all distinct, so they can be arranged among themselves in: \[4! = 24 \text{ ways}\] Step 6: Calculate the total number of arrangements. Total arrangements = (arrangements of 6 units) × (arrangements within the vowel block) \[= 360 \times 24 = 8640\]
Answer: 8640
Question: Find the number of different 7-letter arrangements that can be made from the letters of the word PROBLEM so that all the vowels never occur together. (Hint: use the complement method.)
Solution: Step 1: Identify the letters in PROBLEM. The letters are: P, R, O, B, L, E, M — a total of 7 distinct letters. Step 2: Identify the vowels and consonants. Vowels: O, E (2 vowels, both distinct) Consonants: P, R, B, L, M (5 consonants, all distinct) Step 3: Count the total arrangements of all 7 letters. All 7 letters are distinct, so the total number of arrangements is: \[7! = 5040\] Step 4: Count arrangements where all vowels occur together (unfavourable case). Treat O and E as a single block. We now have this block plus 5 consonants — giving 6 distinct units. Arrangements of 6 units: \[6! = 720\] Arrangements within the vowel block (O and E, both distinct): \[2! = 2\] So arrangements with all vowels together: \[6! \times 2! = 720 \times 2 = 1440\] Step 5: Count arrangements where vowels do NOT all occur together. Using the complement principle: \[\text{Required arrangements} = \text{Total} - \text{All vowels together}\] \[= 5040 - 1440 = 3600\]
Answer: 3600
Question: Find the number of different 9-letter arrangements that can be made from the letters of the word PUBLISHED so that all the vowels always occur together.
Answer: The number of 9-letter arrangements of PUBLISHED with all vowels together is \(7! \times 3! = 30240\).