SOLVER7 Study. Nothing Else.
Chapter 6 Examples Q14(ii)

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

Solution

👶 Simple Explanation

Simple Explanation

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

📖 Arrangements of DAUGHTER with Vowels Not Together

Detailed Explanation

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.

Formula Used

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.

Solution

  1. Step 1: Identify the letters. DAUGHTER has 8 different letters. Vowels are A, U, E (that is 3 vowels) and consonants are D, G, H, T, R (that is 5 consonants). All letters are distinct, so no letters repeat.
  2. Step 2: Find the total number of arrangements of all 8 distinct letters. Since all are different, this is \[ 8! = 40320. \]
  3. Step 3: Now count arrangements where all vowels ARE together. Tie the 3 vowels (A, U, E) into one single block. This block, together with the 5 consonants, gives \( 5 + 1 = 6 \) units to arrange. The number of ways to arrange these 6 units is \[ 6! = 720. \]
  4. Step 4: Inside the vowel block, the 3 vowels can themselves be arranged among each other. The number of internal arrangements is \[ 3! = 6. \] So the total arrangements with all vowels together is \[ 6! \times 3! = 720 \times 6 = 4320. \]
  5. Step 5: Use complementary counting: subtract the 'all vowels together' count from the total. \[ 8! - (6! \times 3!) = 40320 - 4320 = 36000. \]

Final Answer

The number of 8-letter arrangements in which all the vowels do NOT occur together is \( 36000 \).

Common Mistake

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.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify the letters in DAUGHTER. The word has 8 letters: D, A, U, G, H, T, E, R. All 8 letters are distinct (no repeats). The vowels are A, U, E (3 vowels) and the consonants are D, G, H, T, R (5 consonants). — Reason: Knowing which letters are vowels and whether any repeat is essential before applying any counting formula.
  2. Step 2: Count the total number of ways to arrange all 8 distinct letters in a row. Since all letters are different, the total is \[ 8! = 40320. \] — Reason: For n distinct objects arranged in a line, the number of arrangements is n!, so here n = 8 gives 40320.
  3. Step 3: Count the arrangements where ALL three vowels (A, U, E) appear together. Tie A, U, E into one single block. This block acts as one unit. Together with the 5 consonants, we now have \( 5 + 1 = 6 \) units to arrange. — Reason: Grouping all vowels into one block ensures they are always adjacent, which is exactly the scenario we want to exclude.
  4. Step 4: Arrange the 6 units (the vowel-block + 5 consonants) in a row. The number of ways to do this is \[ 6! = 720. \] — Reason: These 6 units are all distinct, so they can be arranged in 6! ways.
  5. Step 5: The 3 vowels inside the block can themselves be arranged in any order. The number of internal arrangements of A, U, E is \[ 3! = 6. \] — Reason: Within the block, the vowels are distinct and can be permuted freely; this multiplies the count by 3!.
  6. Step 6: Combine Steps 4 and 5 to get the total number of arrangements where all vowels ARE together. \[ 6! \times 3! = 720 \times 6 = 4320. \] — Reason: By the multiplication principle, for each arrangement of the 6 units there are 3! internal vowel arrangements, so we multiply.
  7. Step 7: Apply complementary counting. Arrangements where vowels do NOT all occur together = (Total arrangements) \( - \) (Arrangements with all vowels together). \[ 40320 - 4320 = 36000. \] — Reason: Subtracting the unwanted case from the total leaves exactly the count of arrangements in which the three vowels are not all bunched together.

Final Answer

The number of 8-letter arrangements in which all the vowels do NOT occur together is \( 36000 \).

Common Mistake

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.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Total arrangements of 8 distinct letters of DAUGHTER: \[8! = 40320\]
  2. Step 2: Treat vowels A, U, E as one block: arrange \( 5 + 1 = 6 \) units, then arrange 3 vowels within the block: \[6! \times 3! = 720 \times 6 = 4320\]
  3. Step 3: Arrangements where vowels do NOT all occur together: \[40320 - 4320 = 36000\]

Answer: The number of 8-letter arrangements in which all the vowels do NOT occur together is \( 36000 \).

➕ More Examples

More Examples

Example 1

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

Example 2

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

🎯 Try a Similar Question

Try a Similar Question

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.

Solution

  1. Step 1: Identify Letters and Vowels: The word ROUTINES has 8 distinct letters: R, O, U, T, I, N, E, S. The vowels are O, U, I, E — that is 4 vowels. The consonants are R, T, N, S — that is 4 consonants. Since all 8 letters are distinct, we can directly apply permutation formulas.
  2. Step 2: Count Total Arrangements (No Restriction): The total number of arrangements of all 8 distinct letters is: \[8! = 40320\]
  3. Step 3: Count Arrangements Where ALL Vowels Occur Together: Treat the 4 vowels (O, U, I, E) as a single unit or block. Now we have 5 units to arrange: the vowel-block, R, T, N, S. The number of ways to arrange these 5 units is \(5!\) The 4 vowels within the block can themselves be arranged in \(4!\) ways. So the number of arrangements where all vowels are together is: \[5! \times 4! = 120 \times 24 = 2880\]
  4. Step 4: Apply Complementary Counting: The number of arrangements where all vowels do NOT occur together is: \[8! - 5! \times 4! = 40320 - 2880 = 37440\]

Answer: The number of 8-letter arrangements of the word ROUTINES in which all the vowels do NOT occur together is \( 37440 \).

Everything you get with Solver7

More questions in Permutations and Combinations