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{}^n C_r$ equals

  • A
    ${}^{n+2} C_r$
  • B
    ${}^{n+2} C_{r+1}$
  • C
    ${}^{n+1} C_r$
  • D
    ${}^{n+1} C_{r+1}$

Explore More

Similar Questions

If $^nC_r = 84$,$^nC_{r-1} = 36$,and $^nC_{r+1} = 126$,then $n$ equals

Two players $A$ and $B$ play a series of games of badminton. The player, who wins $5$ games first, wins the series. Assuming that no game ends in a draw, the number of ways, in which player $A$ wins the series is . . . . . . .

The number of ways in which five identical balls can be distributed among ten identical boxes such that no box contains more than one ball is:

If ${}^{2n}C_3 : {}^{n}C_3 = 10 : 1$,then the ratio $(n^2 + 3n) : (n^2 - 3n + 4)$ is

If $n$ is even and the value of $^nC_r$ is maximum,then $r = $

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