I just wanted to go though my mistake real quick, for those who may have picked the trap answer.
I made the problem more complicated than it had to be. I tried breaking the counting down into two cases:
Case 1: 2 vowels are picked.
Case 2: 1 vowel is picked
Then, for each case, I would place a vowel in the first letter and a consonant in the last letter. Then, I would try to determine the different arrangements ———> over counting ———> 720 arrangements
The proper way to do this kind of Arrangement problem in which conditions are placed on certain spaces is to use the “slot method” or “box and fill method” or whichever fancy title that may have been used.
_____; ____ ; _____ ; ____ ; ____
Slot 1 ; slot 2 ; slot 3 ; slot 4 ; slot 5
We have:
5 available consonants (V , R , M , N, T)
And
2 available vowels (E , O)
Slot 1 and Slot 5 are both constrained. Using this type of method, one should always start with the most constrained “slots” first
Slot 1: since a vowel must be chosen, we have 2 available options from which to choose —— “2 choose 1” = 2
Slot 5: since a consonant must be chosen, we have 5 available options from which to choose ——— “5 choose 1” = 5
Assume E was chosen for slot 1 and V was chosen for slot 5
We have 4 consonants and 1 vowel —-> 5 letters from which to choose and 3 available spots left
Step 1: how many different combinations of 3 letters can we choose to fill those 3 spots
“5 choose 3” = 5! /3! 2! = 10
AND
Step 2: for each possible combination of 3 letters, how many different ways can we arrange those 3 letters in the 3 spots left
3! = 6
Total Count of Unique Arrangements:
(2) * [ 10 * 6 ] * (5) =
600 unique arrangements
Posted from my mobile device