Another problem from the CBC website, this one submitted by Prof. Peter Rosenthal of the Mathematics Department of the University of Toronto:

This is a question about a tennis tournament. It's organized so that in each round players are randomly paired. If there is an odd number of players, the extra player sits out the round. Losers are all eliminated from the tournament. The rounds continue in the same way until there is only one person remaining, who becomes the champion. The question is: If there are X people who enter the tournament, how many matches will be played in the tournament?

This sounds exactly like the chocolate problem. Every match eliminates one player from the tournament. In a tournament with X players, X-1 players must be eliminated, so there are X-1 matches. The rest of the information is cruft.

Posted by friedlinguini on 2002-06-13 02:53:29