Match the items of List-$I$ to the items of List-$II$:
List-$I$ List-$II$
$(A)$ The number of ways of not selecting $(n-r)$ things from $n$ different things $(I)$ $1+n+{ }^n C_2+\ldots+{ }^n C_r$
$(B)$ $(n-r+1) \cdot{ }^n C_{r-1}$ $(II)$ $(r+1) \cdot{ }^n C_{r+1}$
$(C)$ The number of ways of selecting at least $(n-r)$ things from $n$ different things $(III)$ $r\left({ }^n C_r\right)$
$(D)$ $(n-r)\left({ }^{n-1} C_{r-1}+{ }^{n-1} C_r\right)$ $(IV)$ $2^n-1-n-{ }^n C_2-\ldots-{ }^n C_r$
$(V)$ ${ }^n C_{n-r}$

The correct match is:

  • A
    $A$ $B$ $C$ $D$
    $V$ $III$ $IV$ $II$
  • B
    $A$ $B$ $C$ $D$
    $I$ $II$ $IV$ $III$
  • C
    $A$ $B$ $C$ $D$
    $V$ $III$ $I$ $II$
  • D
    $A$ $B$ $C$ $D$
    $I$ $V$ $IV$ $III$

Explore More

Similar Questions

Let $x$ denote the number of ways of arranging $m$ boys and $m$ girls in a row so that no two boys sit together. If $y$ and $z$ denote the number of ways of arranging $m$ boys and $m$ girls in a row and around a circular table respectively so that boys and girls sit alternately,then $x: y: z=$

The number of times the digit $3$ will be written when listing the integers from $1$ to $1000$ is

Difficult
View Solution

For integers $n$ and $r$,let $\binom{n}{r} = \begin{cases} ^{n}C_{r}, & \text{if } n \geq r \geq 0 \\ 0, & \text{otherwise} \end{cases}$. The maximum value of $k$ for which the sum $\sum_{i=0}^{k}\binom{10}{i}\binom{15}{k-i} + \sum_{i=0}^{k+1}\binom{12}{i}\binom{13}{k+1-i}$ exists,is equal to ...... .

All possible $5$-digit numbers,each having $5$ distinct digits,are formed using the digits $\{1, 2, 3, 5, 6, 8\}$. Among them,the number of such numbers which are divisible by $3$ but not by $6$ is:

The number of $5$-digit numbers that can be formed using the digits $1, 2, 3, 4, 5, 6$ such that the number must include both $1$ and $2$ is:

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo