SOLVER7 Study. Nothing Else.
Miscellaneous Exercise Chapter 6 Q1

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

CBSE Class 11 Maths · Permutations and Combinations

Solution

👶 Simple Explanation

Simple Explanation

Imagine the word DAUGHTER as a bag of 8 letter-tiles. Some tiles are vowels (A, U, E) and the rest are consonants (D, G, H, T, R). We want to pick exactly 5 tiles — 2 vowels and 3 consonants — and then line them up to spell a word. Picking which tiles to take is one job, and arranging them in a row is a second job. We count both jobs and multiply the answers together. That multiplication gives us all the possible words we can make.

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

📖 Forming Words with 2 Vowels and 3 Consonants from DAUGHTER

Detailed Explanation

The word DAUGHTER has 8 distinct letters. Among them the vowels are A, U, E (that is 3 vowels) and the consonants are D, G, H, T, R (that is 5 consonants). We need to build 5-letter words that use exactly 2 vowels and 3 consonants. Since 'with or without meaning' is allowed, we only care about counting arrangements. This is a two-stage problem. First we SELECT which letters go into the word (order does not matter yet), so we use combinations \( {}^{n}C_{r} \). After selecting the 5 letters, we ARRANGE them in a row to form a word (order now matters), so we use the factorial \( 5! \). Finally we multiply all counts together using the fundamental principle of counting.

Formula Used

\[ {}^{n}C_{r} = \frac{n!}{r!\,(n-r)!} \] and number of arrangements of 5 distinct letters is \( 5! \).

Solution

  1. Step 1: Identify the vowels and consonants in DAUGHTER. The letters are D, A, U, G, H, T, E, R, all distinct. Vowels: A, U, E, so there are 3 vowels. Consonants: D, G, H, T, R, so there are 5 consonants.
  2. Step 2: Choose 2 vowels out of the 3 available vowels. The number of ways is \( {}^{3}C_{2} = \frac{3!}{2!\,1!} = 3 \).
  3. Step 3: Choose 3 consonants out of the 5 available consonants. The number of ways is \( {}^{5}C_{3} = \frac{5!}{3!\,2!} = 10 \).
  4. Step 4: Total ways to select the 5 letters (2 vowels and 3 consonants together) is \( {}^{3}C_{2} \times {}^{5}C_{3} = 3 \times 10 = 30 \). This is only the selection; the letters are not yet arranged into a word.
  5. Step 5: Each selected group of 5 distinct letters can be arranged in a row in \( 5! = 120 \) ways to form different words, because the order of letters changes the word.
  6. Step 6: By the fundamental principle of counting, multiply the number of selections by the number of arrangements: \( 30 \times 120 = 3600 \).

Final Answer

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

Common Mistake

A common mistake is to stop after selecting the letters (getting only 30) and forget to arrange them with \( 5! \). Selection tells you WHICH letters are used, but each selection produces \( 5! = 120 \) different words, so you must multiply.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Classify the letters of DAUGHTER: List all letters: D, A, U, G, H, T, E, R — all 8 are distinct. Vowels are A, U, E giving 3 vowels in total, and consonants are D, G, H, T, R giving 5 consonants in total. — Reason: We must know the pool of available vowels and consonants before we can choose from them.
  2. Step 2: Choose 2 vowels from the 3 available vowels: We need exactly 2 vowels, and we have 3 to pick from. The number of ways to do this is \( {}^{3}C_{2} = \frac{3!}{2!\,1!} = 3 \). — Reason: We use combinations here because the order of selection does not matter at this stage; we are only deciding which vowels enter the word.
  3. Step 3: Choose 3 consonants from the 5 available consonants: We need exactly 3 consonants, and we have 5 to pick from. The number of ways to do this is \( {}^{5}C_{3} = \frac{5!}{3!\,2!} = 10 \). — Reason: Again, combinations are used because we are selecting a group, not arranging them yet.
  4. Step 4: Count total ways to select the 5 letters: By the Fundamental Principle of Counting, selecting the vowels AND consonants independently gives \( {}^{3}C_{2} \times {}^{5}C_{3} = 3 \times 10 = 30 \) ways. — Reason: Since the two choices (vowels and consonants) are independent events happening together, we multiply the individual counts.
  5. Step 5: Arrange the 5 chosen letters to form a word: Once any group of 5 distinct letters is selected, the number of ways to arrange them in a row is \( 5! = 120 \). — Reason: Now order matters because different arrangements produce different words, so we use permutations (factorial).
  6. Step 6: Multiply selection and arrangement counts: Total number of words = (ways to select letters) \( \times \) (ways to arrange them) \[ = 30 \times 120 = 3600 \] — Reason: Each of the 30 letter-groups can be arranged in 120 different ways, so by the Fundamental Principle, we multiply to get the grand total.

Final Answer

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

Common Mistake

One common mistake: Students often stop after computing \( {}^{3}C_{2} \times {}^{5}C_{3} = 30 \) and forget to multiply by \( 5! = 120 \) to account for the different arrangements of the selected letters, giving an answer of 30 instead of 3600.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: DAUGHTER: Vowels = A, U, E (3); Consonants = D, G, H, T, R (5)
  2. Step 2: Select 2 vowels from 3 and 3 consonants from 5: \[{}^{3}C_{2} \times {}^{5}C_{3} = 3 \times 10 = 30\]
  3. Step 3: Arrange 5 selected letters: \( 5! = 120 \)
  4. Step 4: Total words \[= 30 \times 120 = 3600\]

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

➕ More Examples

More Examples

Example 1

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 EDUCATION?

Solution: Step 1: Identify the letters in EDUCATION. The letters are E, D, U, C, A, T, I, O, N. Note that all letters are distinct. Step 2: Separate vowels and consonants. Vowels: E, U, A, I, O — that is 5 vowels. Consonants: D, C, T, N — that is 4 consonants. Step 3: Choose 3 vowels from 5 available vowels. The number of ways is \( {}^{5}C_{3} \). \[ {}^{5}C_{3} = \frac{5!}{3! \cdot 2!} = \frac{5 \times 4}{2} = 10 \] Step 4: Choose 2 consonants from 4 available consonants. The number of ways is \( {}^{4}C_{2} \). \[ {}^{4}C_{2} = \frac{4!}{2! \cdot 2!} = \frac{4 \times 3}{2} = 6 \] Step 5: Arrange the selected 5 letters (3 vowels + 2 consonants) in a row. The number of arrangements is \( 5! \). \[ 5! = 120 \] Step 6: Multiply all the results together. \[ \text{Total words} = {}^{5}C_{3} \times {}^{4}C_{2} \times 5! = 10 \times 6 \times 120 = 7200 \]

Answer: 7200 words

Example 2

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

Solution: Step 1: Identify the letters in TRIANGLE. The letters are T, R, I, A, N, G, L, E. All letters are distinct. Step 2: Separate vowels and consonants. Vowels: I, A, E — that is 3 vowels. Consonants: T, R, N, G, L — that is 5 consonants. Step 3: Choose 2 vowels from 3 available vowels. The number of ways is \( {}^{3}C_{2} \). \[ {}^{3}C_{2} = \frac{3!}{2! \cdot 1!} = 3 \] Step 4: Choose 4 consonants from 5 available consonants. The number of ways is \( {}^{5}C_{4} \). \[ {}^{5}C_{4} = \frac{5!}{4! \cdot 1!} = 5 \] Step 5: Arrange the selected 6 letters (2 vowels + 4 consonants) in a row. The number of arrangements is \( 6! \). \[ 6! = 720 \] Step 6: Multiply all the results together. \[ \text{Total words} = {}^{3}C_{2} \times {}^{5}C_{4} \times 6! = 3 \times 5 \times 720 = 10800 \]

Answer: 10800 words

🎯 Try a Similar Question

Try a Similar Question

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 COMBINE?

Solution

  1. Step 1: Identify vowels and consonants in COMBINE: The letters of the word COMBINE are: C, O, M, B, I, N, E. All 7 letters are distinct. Vowels: O, I, E — that is 3 vowels. Consonants: C, M, B, N — that is 4 consonants.
  2. Step 2: Choose 3 vowels from the available vowels: We need to choose 3 vowels from the 3 available vowels (O, I, E). The number of ways to do this is \[ {}^{3}C_{3} = 1 \]
  3. Step 3: Choose 2 consonants from the available consonants: We need to choose 2 consonants from the 4 available consonants (C, M, B, N). The number of ways to do this is \[ {}^{4}C_{2} = \frac{4!}{2! \times 2!} = \frac{4 \times 3}{2 \times 1} = 6 \]
  4. Step 4: Arrange the 5 selected letters: We have selected 5 letters in total (3 vowels + 2 consonants). The number of ways to arrange these 5 letters among themselves is \[ 5! = 120 \]
  5. Step 5: Calculate the total number of words: Using the fundamental principle of counting, the total number of words is \[ {}^{3}C_{3} \times {}^{4}C_{2} \times 5! = 1 \times 6 \times 120 = 720 \]

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

Everything you get with Solver7

More questions in Permutations and Combinations