Find the number of different \(8\)-letter arrangements that can be made from the letters of the word \(DAUGHTER\) so that all vowels do not occur together.
CBSE Class 11 Maths · Permutations and Combinations
CBSE Class 11 Maths · Permutations and Combinations
Imagine you have 8 different alphabet cards spelling DAUGHTER. You want to arrange all 8 cards in a row. Sometimes the three vowel cards A, U, E might end up sitting next to each other — that is the case we want to avoid. A smart trick is to first count ALL possible arrangements, then subtract the ones where the vowels stick together like a group. The vowels-together arrangements are far easier to count by treating them as one big card. What remains after subtracting gives the answer.
Answer: The number of 8-letter arrangements in which all the vowels do NOT occur together is \( 36000 \).
The word DAUGHTER has 8 distinct letters. Among them, the vowels are A, U, E (3 vowels) and the consonants are D, G, H, T, R (5 consonants). We are asked for the number of arrangements in which all three vowels do NOT occur together. It is much easier to count the OPPOSITE case first (arrangements where all vowels DO occur together) and then subtract it from the total number of arrangements. This is called complementary counting. To count the case where all vowels stay together, we treat the block of 3 vowels as a single unit and arrange it along with the other letters, remembering that the vowels can also be rearranged among themselves within the block.
Number of ways = (Total arrangements) - (Arrangements with all vowels together). For distinct objects, arrangements of \( n \) objects is \( n! \), and treating a block gives \( m! \times k! \) where \( m \) units are arranged and \( k \) items inside the block are arranged.
The number of 8-letter arrangements in which all the vowels do NOT occur together is \( 36000 \).
A common mistake is to forget to multiply by \( 3! \) for the internal arrangement of the vowels inside the block, giving \( 8! - 6! = 39600 \) instead of the correct \( 8! - 6! \times 3! = 36000 \). Another error is trying to count 'not together' directly instead of subtracting the 'together' case from the total.
The number of 8-letter arrangements in which all the vowels do NOT occur together is \( 36000 \).
One common mistake: Students forget to multiply by \( 3! \) for the internal arrangements of the vowels within the block, giving \( 6! = 720 \) instead of \( 6! \times 3! = 4320 \) for the 'all vowels together' case, and arriving at the wrong final answer.
Answer: The number of 8-letter arrangements in which all the vowels do NOT occur together is \( 36000 \).
Question: Find the number of different 9-letter arrangements that can be made from the letters of the word FUNCTIONS so that all vowels do not occur together.
Solution: The word FUNCTIONS has 9 letters: F, U, N, C, T, I, O, N, S. First, identify the vowels and consonants. Vowels: U, I, O (3 vowels) Consonants: F, N, C, T, N, S (6 consonants, with N repeated twice) Step 1: Total number of arrangements of all 9 letters of FUNCTIONS. The letter N appears twice. So the total number of arrangements is: \[\frac{9!}{2!}\] Calculating: \(\frac{9!}{2!} = \frac{362880}{2} = 181440\) Step 2: Count arrangements where ALL 3 vowels (U, I, O) occur together. Treat the group \(\{U, I, O\}\) as a single unit. This unit along with the 6 consonants gives us 7 items to arrange: \([UIO], F, N, C, T, N, S\). Among these 7 items, N is repeated twice, so the number of arrangements of these 7 items is: \[\frac{7!}{2!}\] Calculating: \(\frac{7!}{2!} = \frac{5040}{2} = 2520\) The 3 vowels within their group can be arranged among themselves in: \[3! = 6 \text{ ways}\] So total arrangements with all vowels together: \[\frac{7!}{2!} \times 3! = 2520 \times 6 = 15120\] Step 3: Arrangements where all vowels do NOT occur together: \[181440 - 15120 = 166320\]
Answer: 166320
Question: Find the number of different 7-letter arrangements that can be made from the letters of the word JOURNAL so that all vowels do not occur together.
Solution: The word JOURNAL has 7 letters: J, O, U, R, N, A, L, all distinct. First, identify the vowels and consonants. Vowels: O, U, A (3 vowels) Consonants: J, R, N, L (4 consonants) All 7 letters are distinct (no repetitions). Step 1: Total number of arrangements of all 7 letters. \[7! = 5040\] Step 2: Count arrangements where ALL 3 vowels (O, U, A) occur together. Treat the group \(\{O, U, A\}\) as a single unit. This unit together with the 4 consonants gives 5 items to arrange. Number of ways to arrange these 5 items: \[5! = 120\] The 3 vowels within the group can be arranged among themselves in: \[3! = 6 \text{ ways}\] So total arrangements with all vowels together: \[5! \times 3! = 120 \times 6 = 720\] Step 3: Arrangements where all vowels do NOT occur together: \[5040 - 720 = 4320\]
Answer: 4320
Question: Find the number of different 8-letter arrangements that can be made from the letters of the word ROUTINES so that all the vowels do not occur together.
Answer: The number of 8-letter arrangements of the word ROUTINES in which all the vowels do NOT occur together is \( 37440 \).