A man has $7$ friends. In how many ways he can invite one or more of them for a tea party
$128$
$256$
$127$
$130$
How many different words can be formed by jumbling the letters in the word $MISSISSIPPI$ in which no two $S$ are adjacent $?$
Let
$S _1=\{( i , j , k ): i , j , k \in\{1,2, \ldots, 10\}\}$
$S _2=\{( i , j ): 1 \leq i < j +2 \leq 10, i , j \in\{1,2, \ldots, 10\}\},$
$S _3=\{( i , j , k , l): 1 \leq i < j < k < l, i , j , k , l \in\{1,2, \ldots ., 10\}\}$
$S _4=\{( i , j , k , l): i , j , k$ and $l$ are distinct elements in $\{1,2, \ldots, 10\}\}$
and If the total number of elements in the set $S _t$ is $n _z, r =1,2,3,4$, then which of the following statements is (are) TRUE?
$(A)$ $n _1=1000$ $(B)$ $n _2=44$ $(C)$ $n _3=220$ $(D)$ $\frac{ n _4}{12}=420$
The least value of natural number $n$ satisfying $C(n,\,5) + C(n,\,6)\,\, > C(n + 1,\,5)$ is
The value of $\sum\limits_{r = 0}^{n - 1} {\frac{{^n{C_r}}}{{^n{C_r} + {\,^n}{C_{r + 1}}}}} $ equals
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 comman friends. Then the total number of ways in which $X$ and $Y$ together can throw a party inviting $3$ ladies and $3$ men, so that $3$ friends of each of $X$ and $Y$ are in this party is :