SOLVER7 Study. Nothing Else.
Exercise 6.3 Q9(iii)

How many words, with or without meaning can be made from the letters of the word \(MONDAY,\) assuming that no letter is repeated, if. all letters are used but first letter is a vowel \(?\)

CBSE Class 11 Maths · Permutations and Combinations

Solution

👶 Simple Explanation

Simple Explanation

Imagine you have 6 letter cards spelling MONDAY and you want to make a name tag. The rule is that the first card must be a vowel. Only two cards are vowels — O and A. So you pick one of those two for the front spot. After that, you can shuffle the leftover 5 cards in any order you like. There are 120 ways to arrange 5 cards. Since you had 2 choices at the start, you multiply: 2 times 120 gives 240 different name tags.

Answer: The number of words that can be formed with a vowel as the first letter is \( 240 \).

📖 Words from MONDAY Starting with a Vowel

Detailed Explanation

The word MONDAY has 6 distinct letters: M, O, N, D, A, Y. Since no letter repeats, arranging all 6 letters in a row is a permutation problem. Here we have a restriction: the first letter must be a vowel. The vowels in MONDAY are O and A, so there are 2 choices for the first position. Once the first letter is fixed, the remaining 5 letters can be arranged freely in the remaining 5 positions. We use the multiplication (fundamental) principle of counting: total arrangements = (ways to fill first position) \times (ways to fill the rest).

Formula Used

Number of arrangements of \( r \) letters chosen from \( n \) distinct letters is \( {}^{n}P_{r} = \dfrac{n!}{(n-r)!} \). Fundamental principle: total ways \( = \) (choices for step 1) \( \times \) (choices for step 2).

Solution

  1. Step 1: List the letters of MONDAY. They are M, O, N, D, A, Y, which are 6 distinct letters. Among these, the vowels are O and A.
  2. Step 2: Apply the restriction to the first position. The first letter must be a vowel, and there are 2 vowels available. So the number of choices for the first position is \( 2 \).
  3. Step 3: Fill the remaining positions. After placing one vowel in the first spot, 5 distinct letters remain to be arranged in the remaining 5 places. The number of such arrangements is \( {}^{5}P_{5} = 5! \).
  4. Step 4: Compute the factorial. \[ 5! = 5 \times 4 \times 3 \times 2 \times 1 = 120 \]
  5. Step 5: Use the fundamental principle of counting to combine the choices. \[ \text{Total} = 2 \times 5! = 2 \times 120 = 240 \]

Final Answer

The number of words that can be formed with a vowel as the first letter is \( 240 \).

Common Mistake

A common mistake is to arrange all 6 letters as \( 6! = 720 \) and forget the vowel restriction, or to mistakenly include only one vowel. Remember there are 2 vowels (O and A), so the first place has exactly 2 choices, giving \( 2 \times 5! = 240 \).

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Write out all the letters in MONDAY: M, O, N, D, A, Y — that gives us 6 distinct letters in total. — Reason: Confirming that all letters are distinct means no repetition needs to be handled, making this a straightforward permutation problem.
  2. Step 2: Identify the vowels among the 6 letters. The vowels are O and A, so there are \( 2 \) vowels. — Reason: The problem restricts the first position to a vowel only, so we must know exactly how many vowels are available for that slot.
  3. Step 3: Fix the first position: choose one vowel for it. The number of choices for the first position is \( 2 \). — Reason: Only vowels (O or A) are allowed in the first spot, so exactly 2 options exist for this restricted position.
  4. Step 4: After placing one vowel in the first position, exactly 5 distinct letters remain. These 5 letters can fill the remaining 5 positions in \( {}^{5}P_{5} \) ways, which equals \( 5! \). — Reason: Since all remaining positions are unrestricted, every arrangement of the leftover 5 letters is valid, giving a full permutation of 5 items.
  5. Step 5: Evaluate the factorial: \[ 5! = 5 \times 4 \times 3 \times 2 \times 1 = 120 \] — Reason: We need the numerical value of \( 5! \) to compute the final count.
  6. Step 6: Apply the Fundamental Principle of Counting by multiplying the choices at each stage: \[ \text{Total words} = 2 \times 5! = 2 \times 120 = 240 \] — Reason: Each choice of vowel for the first position combines independently with every arrangement of the remaining 5 letters, so we multiply the two counts together.

Final Answer

The number of words that can be formed with a vowel as the first letter is \( 240 \).

Common Mistake

One common mistake: students forget to restrict the first position and simply calculate \( 6! = 720 \) for all arrangements of MONDAY, ignoring the condition that the first letter must specifically be a vowel.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: MONDAY has 6 distinct letters; vowels in first position: O, A — giving \( 2 \) choices.
  2. Step 2: Remaining 5 letters arranged in 5 positions: \( {}^{5}P_{5} = 5! = 120 \)
  3. Step 3: Total \( = 2 \times 120 = 240 \)

Answer: The number of words that can be formed with a vowel as the first letter is \( 240 \).

➕ More Examples

More Examples

Example 1

Question: How many words, with or without meaning, can be formed using all the letters of the word GARDEN, assuming no letter is repeated, if all letters are used but the first letter must be a vowel?

Solution: Step 1: Identify the letters in GARDEN. The letters are G, A, R, D, E, N — a total of \(6\) distinct letters. Step 2: Identify the vowels. The vowels in GARDEN are A and E, so there are \(2\) vowels. Step 3: Fix the first position. The first letter must be a vowel. The number of choices for the first position is \(2\) (either A or E). Step 4: Arrange the remaining letters. After placing one vowel in the first position, \(5\) letters remain. These can be arranged in the remaining \(5\) positions in \(5!\) ways. We compute: \[5! = 5 \times 4 \times 3 \times 2 \times 1 = 120\] Step 5: Apply the multiplication principle. Total number of words = (choices for first position) \(\times\) (arrangements of remaining letters) \[= 2 \times 120 = 240\]

Answer: 240

Example 2

Question: How many words, with or without meaning, can be formed using all the letters of the word JOURNEY, assuming no letter is repeated, if all letters are used but the first letter must be a vowel?

Solution: Step 1: Identify the letters in JOURNEY. The letters are J, O, U, R, N, E, Y — a total of \(7\) distinct letters. Step 2: Identify the vowels. The vowels in JOURNEY are O, U, and E, so there are \(3\) vowels. Step 3: Fix the first position. The first letter must be a vowel. The number of choices for the first position is \(3\) (O, U, or E). Step 4: Arrange the remaining letters. After placing one vowel in the first position, \(6\) letters remain. These can be arranged in the remaining \(6\) positions in \(6!\) ways. We compute: \[6! = 6 \times 5 \times 4 \times 3 \times 2 \times 1 = 720\] Step 5: Apply the multiplication principle. Total number of words = (choices for first position) \(\times\) (arrangements of remaining letters) \[= 3 \times 720 = 2160\]

Answer: 2160

🎯 Try a Similar Question

Try a Similar Question

Question: How many words, with or without meaning, can be formed using all the letters of the word BRINGS, assuming no letter is repeated, such that the first letter is always a vowel?

Solution

  1. Step 1: Identify the letters and vowels: The word BRINGS has 6 distinct letters: B, R, I, N, G, S. Among these, the vowels are: I. So there is exactly 1 vowel.
  2. Step 2: Fix the first position: The first letter must be a vowel. Since there is only 1 vowel (I), the number of choices for the first position is 1.
  3. Step 3: Arrange the remaining letters: After placing the vowel in the first position, we have 5 remaining letters (B, R, N, G, S) to be arranged in the remaining 5 positions. The number of ways to do this is \(5!\).
  4. Step 4: Calculate 5!: We compute: \[5! = 5 \times 4 \times 3 \times 2 \times 1 = 120\]
  5. Step 5: Apply the multiplication principle: Total number of words = (choices for first position) \(\times\) (arrangements of remaining 5 letters) \[= 1 \times 120 = 120\]

Answer: The total number of words that can be formed with a vowel as the first letter is \(120\).

Everything you get with Solver7

More questions in Permutations and Combinations