Tennis Competition

Algebra Level 2

A Single-Elimination Tennis Tournament is being organised. However, so that as many players can participate as possible, the organisers are keeping registrations open until the final day before the start of the event. This means that they will need to know how many matches will be played very soon after registrations close, so as to organise ticket prices. Let the final number of players be $n$ . What is the exact number of matches that will need to be played?

\log_{2}{n}

\frac{n(n-1)}{2}

n

n^2

n-1

1 solution

Oliver Papillo
Jan 20, 2018

After every game, exactly $1$ player will be eliminated.

This means to get $1$ winner, we need $n-1$ eliminations, or $n-1$ games.

Tennis Competition

1 solution

0 pending reports