No of distinct possibilities in a tournament

68 Views Asked by At

Two teams of 7 players each participate in a tournament. First player of a team plays with the first player of the other team and the loser is eliminated. The winner then player with the next player of the other team. One team wins when the other team is eliminated. A team wins when all the players of the other team are eliminated. In how many ways can the tournament happen?

The winning team cannot lose more than 6 matches. Considering it loses 6 matches of 13, then considering it loses 5 of 12.....until 0 of 7. Is this correct?(multiplied by 2)

1

There are 1 best solutions below

0
On BEST ANSWER

You can just think of it as a match between team A and B with each game counting one point and the winner being the first to seven. If you want the number of ways team A can win in nine games, it must win the last one for the match to end then and you can pick any six of the previous eight for them to win. That says there are ${8 \choose 6}=28$ ways for A to win in nine games. For all the possible lengths we would have $${6 \choose 6}+{7 \choose 6}+{8 \choose 6}+{9 \choose 6}+{10 \choose 6}+{11 \choose 6}+{12 \choose 6}$$ ways for A to win and the same number of ways for B to win.

Rather than evaluate the whole sum, we can just imagine that any match shorter than $13$ games is extended to $13$ games by having the side that lost the match win the remaining games. This makes a bijection between the winning matches and the number of ways to choose the seven games the winning side must win, so there are ${13 \choose 7}=1716$ ways for A to win and the same number for B to win, for a total of $3432$.