$A$ committee of $11$ members is to be formed from $8$ males and $5$ females. If $m$ is the number of ways the committee is formed with at least $6$ males and $n$ is the number of ways the committee is formed with at least $3$ females,then:

$A$ person is permitted to select at least one and at most $n$ coins from a collection of $(2n + 1)$ distinct coins. If the total number of ways in which he can select coins is $255$,then $n$ equals

Consider three boxes,each containing $10$ balls labelled $1, 2, \dots, 10$. Suppose one ball is randomly drawn from each of the boxes. Denote by $n_i$ the label of the ball drawn from the $i^{th}$ box,$(i = 1, 2, 3)$. Then,the number of ways in which the balls can be chosen such that $n_1 < n_2 < n_3$ is:

The solution set of $^{10}C_{x-1} > 2 \cdot ^{10}C_x$ is

The number of ways in which $35$ apples can be distributed among $3$ boys so that each can have any number of apples,is

$A$ group of $9$ students,$s_1, s_2, \ldots, s_9$,is to be divided into three teams $X, Y$,and $Z$ of sizes $2, 3$,and $4$,respectively. Suppose that $s_1$ cannot be selected for team $X$,and $s_2$ cannot be selected for team $Y$. The number of ways to form such teams is: