The units digit of $\sum\limits_{1 < p < 100} {p! - \sum\limits_{n = 1}^{50} {(2n)!} }$ is:

If the number of seven-digit numbers,such that the sum of their digits is even,is $m \cdot n \cdot 10^{n}$; $m, n \in \{1, 2, 3, \ldots, 9\}$,then $m+n$ is equal to . . . . . . .

All the letters of the word $TABLE$ are permuted and the strings of letters (may or may not have meaning) thus formed are arranged in dictionary order. Then the rank of the word $TABLE$ counted from the rank of the word $BLATE$ is

Consider the following statements:
$i.$ The number of ways of placing $n$ distinct objects in $k$ distinct bins $(k \leq n)$ such that no bin is empty is ${}^{n-1}C_{k-1}$.
$ii.$ The number of ways of writing a positive integer $n$ as a sum of $k$ positive integers is ${}^{n-1}C_{k-1}$.
$iii.$ The number of ways of placing $n$ distinct objects in $k$ distinct bins such that at least one bin is non-empty is ${}^{n-1}C_{k-1}$.
$iv.$ ${}^nC_k - {}^{n-1}C_k = {}^{n-1}C_{k-1}$.

$A$ letter lock consists of three rings with $15$ different letters each. If $N$ denotes the number of ways in which it is possible to make unsuccessful attempts to open the lock, then:

The number of positive integers less than $10000$ which contain the digit $5$ at least once is