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?
A number is divisible by $10$ if its units digits is $0 .$
Therefore, $0$ is fixed at the units place.
Therefore, there will be as many ways as there are ways of filling $5$ vacant places $\boxed{}\,\boxed{}\,\boxed{}\,\boxed{}\,\boxed{}\,\boxed0\,$ in succession by the remaining $5$ digits (i.e., $1,3,5,7$ and $9$ ).
The $ 5$ vacant places can be filled in $5 !$ Ways.
Hence, required number of $6 -$ digit numbers $=5 !=120$
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 :
If ${a_n} = \sum\limits_{r = 0}^n {} \frac{1}{{^n{C_r}}}$ then $\sum\limits_{r = 0}^n {} \frac{r}{{^n{C_r}}}$ equals
In how many ways $5$ speakers $S_1,S_2,S_3,S_4$ and $S_5$ can give speeches one after the other if $S_3$ wants to speak after $S_1$ & $S_2$
How many words can be formed by taking $3$ consonants and $2$ vowels out of $5$ consonants and $4$ vowels
Total number of $6-$digit numbers in which only and all the five digits $1,3,5,7$ and $9$ appear, is