$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:

There are $n$ white and $n$ black balls marked $1, 2, 3, \ldots, n$. The number of ways in which we can arrange these balls in a row so that neighbouring balls are of different colours is

There are $3$ sections in a question paper and each section contains $5$ questions. $A$ candidate has to answer a total of $5$ questions,choosing at least one question from each section. Then the number of ways,in which the candidate can choose the questions,is

The total number of four-digit numbers such that each of the first three digits is divisible by the last digit is equal to:

If $_n{P_4} = 720 \binom{n}{r}$,then $r = ..........$

$A$ man $X$ has $7$ friends,$4$ of them are ladies and $3$ are men. His wife $Y$ also has $7$ friends,$3$ of them are ladies and $4$ are men. Assume $X$ and $Y$ have no common friends. The total number of ways in which $X$ and $Y$ together can throw a party inviting $3$ ladies and $3$ men,such that $3$ friends of each of $X$ and $Y$ are invited,is: