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?
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$
Similar Questions
If $^{15}{C_{3r}}{ = ^{15}}{C_{r + 3}}$, then the value of $r$ is
If $^{15}{C_{3r}}{ = ^{15}}{C_{r + 3}}$, then the value of $r$ is
- [IIT 1967]
A person wants to climb a $n-$ step staircase using one step or two steps. Let $C_n$ denotes the number of ways of climbing the $n-$ step staircase. Then $C_{18} + C_{19}$ equals
A person wants to climb a $n-$ step staircase using one step or two steps. Let $C_n$ denotes the number of ways of climbing the $n-$ step staircase. Then $C_{18} + C_{19}$ equals
If $^{2n}{C_3}:{\,^n}{C_2} = 44:3$, then for which of the following values of $r$, the value of $^n{C_r}$ will be 15
If $^{2n}{C_3}:{\,^n}{C_2} = 44:3$, then for which of the following values of $r$, the value of $^n{C_r}$ will be 15
The least value of a natural number $n$ such that $\left(\frac{n-1}{5}\right)+\left(\frac{n-1}{6}\right) < \left(\frac{n}{7}\right)$, where $\left(\frac{n}{r}\right)=\frac{n !}{(n-r) ! r !}, i$
The least value of a natural number $n$ such that $\left(\frac{n-1}{5}\right)+\left(\frac{n-1}{6}\right) < \left(\frac{n}{7}\right)$, where $\left(\frac{n}{r}\right)=\frac{n !}{(n-r) ! r !}, i$
- [KVPY 2017]
If $^{{n^2} - n}{C_2}{ = ^{{n^2} - n}}{C_{10}}$, then $n = $
If $^{{n^2} - n}{C_2}{ = ^{{n^2} - n}}{C_{10}}$, then $n = $