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 .$
If ${ }^{n} P_{r}={ }^{n} P_{r+1}$ and ${ }^{n} C_{r}={ }^{n} C_{r-1}$, then the value of $r$ is equal to:
The total number of three-digit numbers, with one digit repeated exactly two times, is
The number of ways, $16$ identical cubes, of which $11$ are blue and rest are red, can be placed in a row so that between any two red cubes there should be at least $2$ blue cubes, is
What is the number of ways of choosing $4$ cards from a pack of $52$ playing cards? In how many of these
four cards are of the same suit,
Let $n(A) = 3, \,n(B) = 3$ (where $n(S)$ denotes number of elements in set $S$), then number of subsets of $(A \times B)$ having odd number of elements, is-