The number of all five-letter words (with or without meaning) having at least one repeated letter that can be formed by using the letters of the word $INCONVENIENCE$ is:

In the product $(1 + x) (1 + x + x^2) (1 + x + x^2 + x^3) \dots (1 + x + x^2 + \dots + x^{100})$,when written in ascending powers of $x$,the highest exponent of $x$ is . . . . . . .

The last two digits of $2015! + 3^{2015}$ are:

For $n \geq 2$,let $S_n$ denote the set of all subsets of $\{1, 2, \ldots, n\}$ such that no two elements are consecutive. For example,$\{1, 3, 5\} \in S_6$,but $\{1, 2, 4\} \notin S_6$. Then $n(S_5)$ is equal to . . . . . . .

Assuming that the balls of the same color are identical,find the number of ways to select one or more balls from $10$ white,$9$ green,and $7$ black balls.

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