If the different permutations of all the letter of the word $\mathrm{EXAMINATION}$ are listed as in a dictionary, how many words are there in this list before the first word starting with $\mathrm{E}$ ?
If the different permutations of all the letter of the word $\mathrm{EXAMINATION}$ are listed as in a dictionary, how many words are there in this list before the first word starting with $\mathrm{E}$ ?
In the given word $EXAMINATION$, there are $11$ letters out of which, $A ,$ $I$ and $N$ appear $2$ times and all the other letters appear only once.
The words that will be listed before the words starting with $E$ in a dictionary will be the words that start with $A $only.
Therefore, to get the number of words starting with $A$, the letter $A$ is fixed at the extreme left position, and then the remaining $10$ letters taken all at a time are rearranged.
since there are $2$ Is and $2$ $Ns$ in the remaining $10$ letters,
Number of words starting with $A=\frac{10 !}{2 ! 2 !}=907200$
Thus, the required numbers of words is $907200 .$
Similar Questions
The number of ways in which $10$ persons can go in two boats so that there may be $5 $ on each boat, supposing that two particular persons will not go in the same boat is
The number of ways in which $10$ persons can go in two boats so that there may be $5 $ on each boat, supposing that two particular persons will not go in the same boat is
How many $6 -$ digit numbers can be formed from the digits, $0,1,3,5,7$ and $9$ which are divisible by $10$ and no digit is repeated?
How many $6 -$ digit numbers can be formed from the digits, $0,1,3,5,7$ and $9$ which are divisible by $10$ and no digit is repeated?
If $^n{C_3} + {\,^n}{C_4} > {\,^{n + 1}}{C_3},$ then
If $^n{C_3} + {\,^n}{C_4} > {\,^{n + 1}}{C_3},$ then
$^{20}C_1 + 3 ^{20}C_2 + 3 ^{20}C_3 + ^{20}C_4$ is equal to-
$^{20}C_1 + 3 ^{20}C_2 + 3 ^{20}C_3 + ^{20}C_4$ is equal to-
A man $X$ has $7$ friends, $4$ of them are ladies and $3$ are men. His wife $Y$ also has $7$ friends, $3$ of them are ladies and $4$ are men. Assume $X$ and $Y$ have no comman friends. Then the total number of ways in which $X$ and $Y$ together can throw a party inviting $3$ ladies and $3$ men, so that $3$ friends of each of $X$ and $Y$ are in this party is :
A man $X$ has $7$ friends, $4$ of them are ladies and $3$ are men. His wife $Y$ also has $7$ friends, $3$ of them are ladies and $4$ are men. Assume $X$ and $Y$ have no comman friends. Then the total number of ways in which $X$ and $Y$ together can throw a party inviting $3$ ladies and $3$ men, so that $3$ friends of each of $X$ and $Y$ are in this party is :
- [JEE MAIN 2017]