${ }^{34} C_5+\sum_{r=0}^4{ }^{(38-r)} C_4=$

Let $m$ and $n$ $(m < n)$ be two $2$-digit numbers. Then the total number of pairs $(m, n)$ such that $\operatorname{gcd}(m, n) = 6$ is . . . . . . .

Two packs of $52$ cards are shuffled together. The number of ways in which a man can be dealt $26$ cards so that he does not get two cards of the same suit and same denomination is

If ${ }^{1} P_{1}+2 \cdot{ }^{2} P_{2}+3 \cdot{ }^{3} P_{3}+\ldots+15 \cdot{ }^{15} P_{15}={ }^{q} P_{r}-s$,where $0 \leq s \leq 1$,then ${ }^{q+s} C_{r-s}$ is equal to .... .

If all the letters of the word $COMBINATION$ are arranged in all possible ways to form $11$ letter words (with or without meaning),then the number of words among them in which $C$ and $N$ occupy the end positions and no vowel appears exactly in the middle position is

$A$ string of letters is to be formed by using $4$ letters from all the letters of the word "$MATHEMATICS$". The number of ways this can be done such that two letters are of the same kind and the other two are of a different kind is: