How many numbers can be formed from the digits $1, 2, 3, 4$ when repetition is not allowed?

There are $(n + 1)$ white balls and $(n + 1)$ black balls. Each ball is numbered from $1$ to $(n + 1)$. In how many ways can these balls be arranged in a row such that no two balls of the same color are adjacent?

The students $S_{1}, S_{2}, \ldots, S_{10}$ are to be divided into $3$ groups $A, B$ and $C$ such that each group has at least one student and the group $C$ has at most $3$ students. Then the total number of possibilities of forming such groups 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$ five-digit number divisible by $3$ is to be formed using the digits $0, 1, 2, 3, 4, 5$ without repetition. The total number of ways this can be done is:

The number of different $5$-digit numbers greater than $50000$ that can be formed using the digits $0, 1, 2, 3, 4, 5, 6, 7$,such that the sum of their first and last digits is not more than $8$,is: