The number of natural numbers less than $10000$ which are divisible by $5$ and in which no digit is repeated is:

The number of ways to distribute $30$ identical candies among four children $C_{1}, C_{2}, C_{3}$ and $C_{4}$ such that $C_{2}$ receives at least $4$ and at most $7$ candies,and $C_{3}$ receives at least $2$ and at most $6$ candies,is equal to

If $a_n = \sum_{r=0}^n \frac{1}{\binom{n}{r}}$,then $\sum_{r=0}^n \frac{r}{\binom{n}{r}} = .....$

The remainder obtained when $1! + 2! + 3! + \dots + 11!$ is divided by $12$ is

For integers $n$ and $r$,let $\binom{n}{r} = \begin{cases} ^{n}C_{r}, & \text{if } n \geq r \geq 0 \\ 0, & \text{otherwise} \end{cases}$. The maximum value of $k$ for which the sum $\sum_{i=0}^{k}\binom{10}{i}\binom{15}{k-i} + \sum_{i=0}^{k+1}\binom{12}{i}\binom{13}{k+1-i}$ exists,is equal to ...... .

The number of four-lettered words that can be formed from the letters of the word $MAYANK$ such that both $A$'s are included but never together,is equal to: