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
CBSE Class 11 Maths · Permutations and Combinations
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 \).
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).
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).
The number of words that can be formed with a vowel as the first letter is \( 240 \).
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 \).
The number of words that can be formed with a vowel as the first letter is \( 240 \).
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.
Answer: The number of words that can be formed with a vowel as the first letter is \( 240 \).
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
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
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?
Answer: The total number of words that can be formed with a vowel as the first letter is \(120\).