The English alphabet has $5$ vowels and $21$ consonants. How many words with two different vowels and $2$ different consonants can be formed from the alphabet?
The English alphabet has $5$ vowels and $21$ consonants. How many words with two different vowels and $2$ different consonants can be formed from the alphabet?
$2$ different vowels and $2$ different consonants are to be selected from the English alphabet. since there are $5$ vowels in the English alphabet, number of ways of selecting $2$ different vowels from the alphabet $=\,^{5} C_{2}=\frac{5 !}{2 ! 3 !}=10$
since there are $21$ consonants in the English alphabet, number of ways of selecting $2$ different consonants from the alphabet $=\,^{21} C_{2}=\frac{21 !}{2119 !}=210$
Therefore, number of combinations of $2$ different vowels and $2$ different consonants $=10 \times 210=2100$
Each of these $2100 $ combinations has $4$ letters, which can be arranged among themselves in $4 !$ ways.
Therefore, required number of words $=2100 \times 4 !=50400$
Similar Questions
How many different words can be formed by jumbling the letters in the word $MISSISSIPPI$ in which no two $S$ are adjacent $?$
How many different words can be formed by jumbling the letters in the word $MISSISSIPPI$ in which no two $S$ are adjacent $?$
- [AIEEE 2008]
Consider a class of $5$ girls and $7$ boys. The number of different teams consisting of $2$ girls and $3$ boys that can be formed from this class, if there are two specific boys $A$ and $B$, who refuse to be the members of the same team, is
Consider a class of $5$ girls and $7$ boys. The number of different teams consisting of $2$ girls and $3$ boys that can be formed from this class, if there are two specific boys $A$ and $B$, who refuse to be the members of the same team, is
- [JEE MAIN 2019]
Let $A=\left[a_{i j}\right], a_{i j} \in Z \cap[0,4], 1 \leq i, j \leq 2$. The number of matrices $A$ such that the sum of all entries is a prime number $p \in(2,13)$ is $........$.
Let $A=\left[a_{i j}\right], a_{i j} \in Z \cap[0,4], 1 \leq i, j \leq 2$. The number of matrices $A$ such that the sum of all entries is a prime number $p \in(2,13)$ is $........$.
- [JEE MAIN 2023]
If for some $\mathrm{m}, \mathrm{n} ;{ }^6 \mathrm{C}_{\mathrm{m}}+2\left({ }^6 \mathrm{C}_{\mathrm{m}+1}\right)+{ }^6 \mathrm{C}_{\mathrm{m}+2}>{ }^8 \mathrm{C}_3$ and ${ }^{n-1} P_3:{ }^n P_4=1: 8$, then ${ }^n P_{m+1}+{ }^{n+1} C_m$ is equal to
If for some $\mathrm{m}, \mathrm{n} ;{ }^6 \mathrm{C}_{\mathrm{m}}+2\left({ }^6 \mathrm{C}_{\mathrm{m}+1}\right)+{ }^6 \mathrm{C}_{\mathrm{m}+2}>{ }^8 \mathrm{C}_3$ and ${ }^{n-1} P_3:{ }^n P_4=1: 8$, then ${ }^n P_{m+1}+{ }^{n+1} C_m$ is equal to
- [JEE MAIN 2024]
At an election, a voter may vote for any number of candidates, not greater than the number to be elected. There are $10$ candidates and $4$ are of be selected, if a voter votes for at least one candidate, then the number of ways in which he can vote is
At an election, a voter may vote for any number of candidates, not greater than the number to be elected. There are $10$ candidates and $4$ are of be selected, if a voter votes for at least one candidate, then the number of ways in which he can vote is
- [AIEEE 2006]