The number of permutations of the digits $1, 2, 3, ..., 7$ without repetition,which neither contain the string $153$ nor the string $2467$,is $........$.

If $x$ and $y$ are digits such that $17! = 355687428096000$, then $x+y$ equals

If $S_n = \sum_{r=0}^n \frac{1}{^nC_r}$ and $T_n = \sum_{r=0}^n \frac{r}{^nC_r}$,then $\frac{T_n}{S_n}$ is equal to

There are $4$ notes of Rs. $100$ and $5$ other notes of denominations Rs. $1$,Rs. $2$,Rs. $5$,Rs. $20$,and Rs. $50$. These $9$ notes are to be distributed among $3$ children such that each child receives at least one note of Rs. $100$. Find the total number of ways of distribution.

From a group of $7$ batsmen and $6$ bowlers,$10$ players are to be chosen for a team,which should include at least $4$ batsmen and at least $4$ bowlers. One batsman and one bowler,who are the captain and vice-captain of the team respectively,must be included. The total number of ways such a selection can be made is:

Let $S$ be the set of all passwords which are $6$ to $8$ characters long,where each character is either an alphabet from $\{A, B, C, D, E\}$ or a number from $\{1, 2, 3, 4, 5\}$ with the repetition of characters allowed. If the number of passwords in $S$ whose at least one character is a number from $\{1, 2, 3, 4, 5\}$ is $\alpha \times 5^{6}$,then $\alpha$ is equal to $.......$