SOLVER7 Study. Nothing Else.
Chapter 6 Miscellaneous Examples Q20

How many words, with or without meaning, each of \(3\) vowels and \(2\) consonants can be formed from the letters of the word \(INVOLUTE\ ?\)

CBSE Class 11 Maths · Permutations and Combinations

Solution

👶 Simple Explanation

Simple Explanation

Imagine picking toppings for a tiny pizza with only 5 spots. The word INVOLUTE has 4 vowels (I, O, U, E) and 4 consonants (N, V, L, T). You must fill exactly 3 spots with vowels and 2 spots with consonants. There are a few ways to pick which vowels and consonants to use. Once you have chosen your 5 letters, you can arrange them in many different orders to make different words. Multiply all those choices together and you get the total count of possible words.

Answer: The number of words that can be formed is \( 2880 \).

📖 Forming Words with 3 Vowels and 2 Consonants from INVOLUTE

Detailed Explanation

The word INVOLUTE has 8 distinct letters. Among them the vowels are I, O, U, E (that is 4 vowels), and the consonants are N, V, L, T (that is 4 consonants). We want to form 5-letter words made of exactly 3 vowels and 2 consonants. Since all letters are different, this is a two-stage counting task. First we CHOOSE which vowels and consonants to use — choosing does not care about order, so we use combinations \( {}^{n}C_{r} \). Second, once we have picked 5 particular letters, we ARRANGE them into a word — order matters here, so we use factorial arrangements. Finally, by the fundamental principle of counting, we multiply the choices together with the number of arrangements.

Formula Used

Number of ways to choose \( r \) items from \( n \) distinct items: \[ {}^{n}C_{r} = \frac{n!}{r!\,(n-r)!} \] Number of arrangements of \( k \) distinct letters: \( k! \)

Solution

  1. Step 1: Identify the vowels and consonants in INVOLUTE. The vowels are I, O, U, E, so there are 4 vowels. The consonants are N, V, L, T, so there are 4 consonants. All 8 letters are distinct.
  2. Step 2: Choose the 3 vowels from the 4 available vowels. Order does not matter while choosing, so we use combinations. \[ {}^{4}C_{3} = \frac{4!}{3!\,1!} = 4 \]
  3. Step 3: Choose the 2 consonants from the 4 available consonants, again using combinations. \[ {}^{4}C_{2} = \frac{4!}{2!\,2!} = 6 \]
  4. Step 4: Find the total number of ways to select the 5 letters by multiplying the two selections. \[ {}^{4}C_{3} \times {}^{4}C_{2} = 4 \times 6 = 24 \] So there are 24 different groups of 5 letters.
  5. Step 5: Each group of 5 distinct letters can be arranged into a word in \( 5! \) ways, because order matters in a word. \[ 5! = 120 \]
  6. Step 6: By the fundamental principle of counting, multiply the number of letter groups by the number of arrangements of each group. \[ 24 \times 120 = 2880 \]

Final Answer

The number of words that can be formed is \( 2880 \).

Common Mistake

A common mistake is to stop after choosing the letters (getting 24) and forget to arrange them, or to skip the selection step and only compute \( 5! \). You must both CHOOSE the letters with combinations AND ARRANGE them with \( 5! \), then multiply.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Write out the letters in INVOLUTE and sort them into vowels and consonants. Vowels (I, O, U, E): 4 letters. Consonants (N, V, L, T): 4 letters. All 8 letters are distinct. — Reason: Knowing exactly how many vowels and consonants are available tells us the pool from which we will select.
  2. Step 2: Choose 3 vowels from the 4 available vowels. Since the order of selection does not matter here, use combinations: \[{}^{4}C_{3} = \frac{4!}{3!\,1!} = \frac{24}{6 \times 1} = 4\] — Reason: We only care which vowels are picked, not the order in which we pick them, so combinations apply.
  3. Step 3: Choose 2 consonants from the 4 available consonants, again using combinations: \[{}^{4}C_{2} = \frac{4!}{2!\,2!} = \frac{24}{2 \times 2} = 6\] — Reason: Same logic as Step 2 — selection is order-free, so we use \( {}^{n}C_{r} \).
  4. Step 4: Find the total number of distinct 5-letter groups by multiplying the two selections: \[{}^{4}C_{3} \times {}^{4}C_{2} = 4 \times 6 = 24\] — Reason: For every way to choose the vowels, each set of consonant choices is possible, so we multiply (Fundamental Principle of Counting).
  5. Step 5: Arrange the 5 chosen distinct letters into a word. The number of arrangements of 5 distinct letters is: \[5! = 5 \times 4 \times 3 \times 2 \times 1 = 120\] — Reason: A word is an ordered sequence, so every different ordering counts as a different word; we use factorial for arrangements.
  6. Step 6: Combine both stages to get the final count: \[{}^{4}C_{3} \times {}^{4}C_{2} \times 5! = 24 \times 120 = 2880\] — Reason: Each of the 24 letter-groups can be arranged in 120 ways, giving the total number of 5-letter words.

Final Answer

The number of words that can be formed is \( 2880 \).

Common Mistake

One common mistake: Students often forget to multiply by \( 5! \) after selecting the letters, leaving the answer as 24 — this counts only the number of letter groups chosen, not the actual ordered words formed from them.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: INVOLUTE: Vowels = {I, O, U, E} (4 vowels), Consonants = {N, V, L, T} (4 consonants).
  2. Step 2: Select 3 vowels from 4 and 2 consonants from 4: \[{}^{4}C_{3} \times {}^{4}C_{2} = 4 \times 6 = 24\]
  3. Step 3: Arrange the chosen 5 distinct letters: \[5! = 120\]
  4. Step 4: Total words: \[24 \times 120 = 2880\]

Answer: The number of words that can be formed is \( 2880 \).

➕ More Examples

More Examples

Example 1

Question: How many words, with or without meaning, each consisting of 2 vowels and 3 consonants, can be formed from the letters of the word EQUATION?

Solution: Step 1: Identify the distinct letters in the word EQUATION. The letters are: E, Q, U, A, T, I, O, N. Step 2: Classify each letter as a vowel or consonant. Vowels: E, U, A, I, O — total \( 5 \) distinct vowels. Consonants: Q, T, N — total \( 3 \) distinct consonants. Step 3: We need 2 vowels and 3 consonants. Ways to choose 2 vowels from 5: \[ {}^{5}C_{2} = \frac{5!}{2! \times 3!} = \frac{5 \times 4}{2} = 10 \] Ways to choose 3 consonants from 3: \[ {}^{3}C_{3} = \frac{3!}{3! \times 0!} = 1 \] Step 4: Total letters selected = \( 2 + 3 = 5 \). Number of ways to arrange these 5 letters: \[ 5! = 120 \] Step 5: Total number of words: \[ {}^{5}C_{2} \times {}^{3}C_{3} \times 5! = 10 \times 1 \times 120 = 1200 \]

Answer: 1200 words

Example 2

Question: How many words, with or without meaning, each consisting of 3 vowels and 2 consonants, can be formed from the letters of the word DAUGHTER?

Solution: Step 1: Identify the distinct letters in the word DAUGHTER. The letters are: D, A, U, G, H, T, E, R. Step 2: Classify each letter as a vowel or consonant. Vowels: A, U, E — total \( 3 \) distinct vowels. Consonants: D, G, H, T, R — total \( 5 \) distinct consonants. Step 3: We need 3 vowels and 2 consonants. Ways to choose 3 vowels from 3: \[ {}^{3}C_{3} = \frac{3!}{3! \times 0!} = 1 \] Ways to choose 2 consonants from 5: \[ {}^{5}C_{2} = \frac{5!}{2! \times 3!} = \frac{5 \times 4}{2} = 10 \] Step 4: Total letters selected = \( 3 + 2 = 5 \). Number of ways to arrange these 5 letters: \[ 5! = 120 \] Step 5: Total number of words: \[ {}^{3}C_{3} \times {}^{5}C_{2} \times 5! = 1 \times 10 \times 120 = 1200 \]

Answer: 1200 words

🎯 Try a Similar Question

Try a Similar Question

Question: How many words, with or without meaning, each consisting of 2 vowels and 3 consonants, can be formed from the letters of the word EQUATION? (Each letter is used at most once.)

Solution

  1. Step 1: Identify the vowels and consonants in EQUATION: The word EQUATION has 8 letters: E, Q, U, A, T, I, O, N. The vowels are E, U, A, I, O — that is 5 distinct vowels. The consonants are Q, T, N — that is 3 distinct consonants.
  2. Step 2: Select 2 vowels from 5 vowels: The number of ways to choose 2 vowels from the 5 available vowels is \[ {}^{5}C_{2} = \frac{5!}{2! \cdot 3!} = 10. \]
  3. Step 3: Select 3 consonants from 3 consonants: The number of ways to choose 3 consonants from the 3 available consonants is \[ {}^{3}C_{3} = \frac{3!}{3! \cdot 0!} = 1. \]
  4. Step 4: Count the total number of letter selections: The total number of ways to select the group of 5 letters (2 vowels and 3 consonants) is \[ {}^{5}C_{2} \times {}^{3}C_{3} = 10 \times 1 = 10. \]
  5. Step 5: Arrange the 5 selected letters: Each group of 5 letters can be arranged among themselves in \[ 5! = 120 \text{ ways.} \]
  6. Step 6: Compute the final answer: The total number of words that can be formed is \[ 10 \times 120 = 1200. \]

Answer: The total number of words that can be formed is \( 1200 \).

Everything you get with Solver7

More questions in Permutations and Combinations