For the first one you are close: , you choose one vowel from five, but there are six places to insert it in the string.
is the number of ways to have no vowels so is the number of ways to have at least one.
Hey all Im having trouble with this 1 problem, hope you guys can help me through it and understand it.
The English alphabet contains 21 consonants and five vowels. How many strings of six lowercase letters of the English alphabet contain:
a)exactly 1 vowel, the answer is 122523030, but I don't know how they got the answer. I did 21*21*21*21*21*5, but didn't get the same answer.
b)exactly two vowels, I did 21*21*21*21*5*5 but is wrong the answer is 72930375
c)at least one vowel: I don't quite understand the concept of calculating problems with at least or at most.
d) at most 2 vowels
thanks for your help in advance
Ok, so it was 21^5 * 5 vowels * 6 places to place them
which is 21^5*30
but for the next problem for exactly 2 vowels in it.
the answer is 72930375 but I didn't get it.
isn't it 21^4 * 5 vowels * 6 places * 5 vowels * 5 places?
in other words isn't it 21^4*750?
ahh, I got it. Its combination of 2 out of 6 * 5^2 then * 21^4.
Sorry to be a bother but, problems like at least one vowel or at most two vowels. How would I approach this? I don't seem to get it, if it is at least one vowel then if I find exactly one vowel wouldn't that fulfill the requirement of least one vowel?