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 . . . . . . .

  • A
    $126$
  • B
    $252$
  • C
    $128$
  • D
    $256$

Explore More

Similar Questions

If $2 \times {}^nC_5 = 9 \times {}^{n-2}C_5$,then the value of $n$ 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:

$A$ set contains $(2n + 1)$ elements. The number of subsets of the set which contain at most $n$ elements is:

$^nC_r + 2^nC_{r-1} + ^nC_{r-2} = $

Let the number of elements in sets $A$ and $B$ be $5$ and $2$ respectively. Then the number of subsets of $A \times B$ each having at least $3$ and at most $6$ elements 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