Combinations practice · Mixed difficulty

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

If ${\;^{189}}{C_{35}} + {\;^{189}}{C_x} = {\;^{190}}{C_x}$, then $x$ is equal to

The total number of positive integral solutions $\left( {x,\,y,\,z} \right),$ such that $xyz = 24$ is

The number of positive integers satisfying the inequality $n + {1_{{C_{n - 2}}}} - n + {1_{{C_{n - 1}}}} \le 50$ is

Let the number of elements in sets $A$ and $B$ be five and two respectively. Then the number of subsets of $A \times B$ each having at least 3 and at most 6 elements is

In how many ways can Rs 16 be divided into 4 persons when none of them get less than Rs 3?

If ${ }^n C_{r-1}=36,{ }^n C_r=84$ and ${ }^n C_{r+1}=126$, then the value of $r$ is equal to

In a college examination, a candidates is required to answer 6 out of 10 questions which are divided into two sections each containing 5 questions. Further the candidate is not permitted to attempt more than 4 questions from either of the section. The number of ways in which he can make up a choice of 6 questions, is

A father with 8 children takes 3 at a time to the zoological garden, as often as he can without taking the same 3 children together more than once. The number of times he will go to the garden, is

The packs of 52 cards are shuffled together. The number of ways in which a man can be dealt 26 cards so that he does not get two cards of the same suit and same denomination, is

Consider 26 tangent lines to an ellipse. The lines separate the plane into several regions, some enclosed and others un- bounded. Then the number of unbounded regions is

The set $S = \left\{ {1,\;2,\;3,\; \ldots ,\;12} \right\}$ is to be partitioned into three sets $A,\;B,\;C$ of equal size
Thus, $A \cup B \cup C = S$
$A \cup B = B \cup C = A \cup C = \emptyset$
The number of ways to partition $S$ is

There are 20 lines numbered as $1,2,3 \ldots 20$. All the odd numbered lines intersect at a point and all the even numbered lines are parallel. Find the maximum number of point of intersections.

If 7 points out of 12 are in the same straight line, then the number of triangles formed is

Consider the following statements.

I. If there are $n$ different objects, then ${ }^n C_r={ }^n C_{n-r}$, $0 \leq {r} \leq {n}$.

II. If there are $n$ different objects, then ${ }^n C_r+{ }^n C_{r-1}={ }^{n+1} C_r, 0 \leq {r} \leq {n}.$

Choose the correct option.

The number of ways in which one can select three distinct integers between 1 and 30, both inclusive, whose sum is even, is

In a Mathematics paper there are three sections containing 4, 5 and 6 questions respectively. From each section 3 questions are to be answered. In how many ways can be selection of questions be made?

A box contains two white balls, three black balls and four red balls. In how many ways can three balls be drawn from the box, if at least one black ball is to be included in the draw?

There are 10 lamps in a hall. Each one of them can be switched on independently. The number of ways in which the hall can be illuminated, is

For $x \in {R}$, let $[x]$ denote the greatest integer $\leq x$, then value of $\left[-\frac{1}{3}\right]+\left[-\frac{1}{3}-\frac{1}{100}\right]$ $+\left[-\frac{1}{3}-\frac{2}{100}\right]+\ldots+\left[-\frac{1}{3}-\frac{99}{100}\right]$ is

A lady given a dinner party for six guest. The number of ways in which they may be selected from among ten friends, if two of the friends will not, attends the party together is

Six cards and six envelopes are numbered 1, 2, 3, 4, 5, 6 and cards are to be placed in envelopes so that each envelope contains exactly one card and no card is placed in the envelope bearing the same number and moreover the card numbered 1 is always placed in envelope numbered 2. Then, the number of ways it can be done is

The number of ways of selecting 10 balls from unlimited number of red, black, white and green balls is

If ${\sum\limits_{i = 1}^{20} {\left( {\frac{{{}^{20}{C_{i - 1}}}}{{{}^{20}{C_i} + {}^{20}{C_{i - 1}}}}} \right)} ^3} = \frac{k}{{21}},$ then $k$ equals

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

${ }^{n-1} C_r=\left(k^2-8\right)^n C_{r+1}$ if and only if:

The smallest value of $x$ satisfying the inequlity ${\;^{10}}{C_{x - 1}} > 2.{\;^{10}}{C_x}$ is

In the next world cup of cricket there will be 12 teams, divided equally in two groups. Teams of each group will play a match against each other. From each group 3 top teams will qualify for the next round. In this round each team will play against others once.
Four top teams of this round will qualify for the semi- final round, where each team will play against the others once. Two top teams of this round will go to the final round, where they will play the best of three matches. The minimum number of matches in the next world cup will be

The maximum number of points of intersection of 6 circles is

There are 15 points in a plane, no two of which are in a straight line except 4, all of which are in a straight line. The number of triangles that can be formed by using these 15 points is