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
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]
$\mathop \sum \limits_{0 \le i < j \le n} i\left( \begin{array}{l}
n\\
j
\end{array} \right)$ is equal to
$\mathop \sum \limits_{0 \le i < j \le n} i\left( \begin{array}{l}
n\\
j
\end{array} \right)$ is equal to
In an election the number of candidates is $1$ greater than the persons to be elected. If a voter can vote in $254$ ways, then the number of candidates is
In an election the number of candidates is $1$ greater than the persons to be elected. If a voter can vote in $254$ ways, then the number of candidates is
There are $m$ books in black cover and $n$ books in blue cover, and all books are different. The number of ways these $(m+n)$ books can be arranged on a shelf so that all the books in black cover are put side by side is
There are $m$ books in black cover and $n$ books in blue cover, and all books are different. The number of ways these $(m+n)$ books can be arranged on a shelf so that all the books in black cover are put side by side is
- [KVPY 2020]
If $^n{C_r} = 84,{\;^n}{C_{r - 1}} = 36$ and $^n{C_{r + 1}} = 126$, then $n$ equals
If $^n{C_r} = 84,{\;^n}{C_{r - 1}} = 36$ and $^n{C_{r + 1}} = 126$, then $n$ equals