1.1.5 problem 5

(a)

By the end of each round, half of the players participating in the round are eliminated. So, the problem reduces to finding out how many times the number of players can be halved before a single player is left.

The number of times $2^N$ can be divided by two is ${\log }_2{2}^N$ which means the total amount of rounds in the tournament is

$$N$$

(b)

The number of games in a given round is $\frac{N_r}{2}$. We can sum up these values for all the rounds.

(1.1)

(c)

Tournament is over when a single player is left. Hece, $N-1$ players need to be eliminated. As a result of a match, exactly one player is eliminated. Hence, the number of matches needed to eliminate $N-1$ people is

$$N-1$$