How many words from $5$ different letters can be formed out of $10$ consonants and $5$ vowels if 'a' is always one of the vowels and the words have at least $2$ consonants?
My approach to this has been like this:
$1$ way of choosing "a".
${10\choose 2}$ ways of choosing the two mandatory consonant.
${14\choose 2}$ ways of choosing the letters for the other two letters of the word.
$5!$ ways of rearranging everything.
So the answer is: $1{10\choose 2}{14\choose 2}5!$
Is this correct?
I think another approach could be calculate all the possible words and subtract the combinations for one vowel and the combinations from $2$ consonants, but I don't get the same result.
Here is an outline toward the solution, which I hope is helpful.
First, you need to be sure to pick the A. You can argue that the probability of picking the A and 4 non-A's in 5 draws without replacement is $1/3.$
Second, given that you have picked the A, @lulu has shown how to find the probability of picking 2 or more consonants.
Then $P(\text{A & 2 Cons})=P(\text{A})P(\text{2 Cons}|\text{A}) = 0.3196803.$
By the simulation below (using R) of a million such choices of five letters, we see that the answer is about 0.319 or 0.320.