Two players and play a series of badminton games. The first player, who wins 5 games first, wins the series. Assuming that no game ends in a draw, the number of ways in which player wins the series is :_____.
To find the number of ways player can win the series, we need to consider all the different scenarios based on the total number of games played.
Since the first player to win 5 games wins the series, the series can last anywhere from 5 games to a maximum of 9 games (because if they played 10 games, one player would have already reached 5 wins).
For player to win in exactly games, player must win the very last game (the game). This means in the preceding games, player must have won exactly 4 games.
We sum the number of ways for to win for each possible series length:
Total Games (n) |
Wins for A in first n−1 games |
Calculation: (4n−1) |
Number of Ways |
5 Games |
4 wins in 4 games |
1 |
|
6 Games |
4 wins in 5 games |
5 |
|
7 Games |
4 wins in 6 games |
15 |
|
8 Games |
4 wins in 7 games |
35 |
|
9 Games |
4 wins in 8 games |
70 |
Now, we add these individual scenarios together:
The number of ways in which player wins the series is 126.
Tagged Combinations and selections with conditions. Machine-assigned, so read it as a strong shortlist rather than a verdict.