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$
If $^n{C_r}$ denotes the number of combinations of $n$ things taken $r$ at a time, then the expression $^n{C_{r + 1}} + {\,^n}{C_{r - 1}} + \,2 \times {\,^n}{C_r}$ equals
What is the number of ways of choosing $4$ cards from a pack of $52$ playing cards? In how many of these
four cards are of the same suit,
Words of length $10$ are formed using the letters, $A, B, C, D, E, F, G, H, I, J$. Let $x$ be the number of such words where no letter is repeated ; and let $y$ be the number of such words where exactly one letter is repeated twice and no other letter is repeated. Then, $\frac{y}{9 x}=$
If $^{15}{C_{3r}}{ = ^{15}}{C_{r + 3}}$, then the value of $r$ is
Statement$-1:$ The number of ways of distributing $10$ identical balls in $4$ distinct boxes such that no box is empty is $^9C_3 .$
Statement$-2:$ The number of ways of choosing any $3$ places from $9$ different places is $^9C_3 $.