SOLUTION: I cant quite figure out this question. -> There are 32 players in a single-elimination chess tournament. That is, a player who loses once is eliminated. Assuming that no ties are a

Algebra ->  Polynomials-and-rational-expressions -> SOLUTION: I cant quite figure out this question. -> There are 32 players in a single-elimination chess tournament. That is, a player who loses once is eliminated. Assuming that no ties are a      Log On


   



Question 621784: I cant quite figure out this question. -> There are 32 players in a single-elimination chess tournament. That is, a player who loses once is eliminated. Assuming that no ties are allowed, how many games must be played to determine a champion?
How do you figure it out.

Answer by Alan3354(69443) About Me  (Show Source):
You can put this solution on YOUR website!
I cant quite figure out this question. -> There are 32 players in a single-elimination chess tournament. That is, a player who loses once is eliminated. Assuming that no ties are allowed, how many games must be played to determine a champion?
--------------
The 32 players will have 16 games, 16 players left.
Then 8 games, 4 games, 2 games, 1 game.
--> 31 games