Chess Tournament. Imagine there are 35 people in an elimination chess tournament. In the first round contestants 1 through 34 are paired into 17 games and contestant # 35 receives a "bye" meaning he or she gets to sit out that round. The 17 losers are eliminated from the contest. In the next round the 17 winners and contestant #35 get paired into 9 games. So far 26 games have been played. The contest will continue like this until there is only one winner. 1a) How many total games (not sets of games, or rounds, but total individual games) will be played to select the winner? Show your work (i.e. justify your numerical answer). 1b) Complete the table showing how many total games will be played given various numbers of contestants in the tournament. n = number of contestants, Gn = number of games. I explained the first two for you. You should explain the next two, then you can quit explaining them. n 1 2 3 4 5 6 1 Gn 0 1 Explanation No games need to be played. The only contestant wins. They play each other and one person wins.

Algebra and Trigonometry (6th Edition)
6th Edition
ISBN:9780134463216
Author:Robert F. Blitzer
Publisher:Robert F. Blitzer
ChapterP: Prerequisites: Fundamental Concepts Of Algebra
Section: Chapter Questions
Problem 1MCCP: In Exercises 1-25, simplify the given expression or perform the indicated operation (and simplify,...
icon
Related questions
Question
Chess Tournament. Imagine there are 35 people in an elimination chess tournament. In the first round
contestants 1 through 34 are paired into 17 games and contestant #35 receives a "bye" meaning he or she
gets to sit out that round. The 17 losers are eliminated from the contest. In the next round the 17 winners
and contestant #35 get paired into 9 games. So far 26 games have been played. The contest will continue
like this until there is only one winner.
1a) How many total games (not sets of games, or rounds, but total individual games) will be played to
select the winner? Show your work (i.e. justify your numerical answer).
n
1b) Complete the table showing how many total games will be played given various numbers of contestants
in the tournament. n = number of contestants, G₁ = number of games. I explained the first two for you.
You should explain the next two, then you can quit explaining them.
1
2
3
4
5
6
7
1/2
Gn
100% +
0
1
Explanation
No games need to be played. The only contestant wins.
They play each other and one person wins.
Transcribed Image Text:Chess Tournament. Imagine there are 35 people in an elimination chess tournament. In the first round contestants 1 through 34 are paired into 17 games and contestant #35 receives a "bye" meaning he or she gets to sit out that round. The 17 losers are eliminated from the contest. In the next round the 17 winners and contestant #35 get paired into 9 games. So far 26 games have been played. The contest will continue like this until there is only one winner. 1a) How many total games (not sets of games, or rounds, but total individual games) will be played to select the winner? Show your work (i.e. justify your numerical answer). n 1b) Complete the table showing how many total games will be played given various numbers of contestants in the tournament. n = number of contestants, G₁ = number of games. I explained the first two for you. You should explain the next two, then you can quit explaining them. 1 2 3 4 5 6 7 1/2 Gn 100% + 0 1 Explanation No games need to be played. The only contestant wins. They play each other and one person wins.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps

Blurred answer
Similar questions
Recommended textbooks for you
Algebra and Trigonometry (6th Edition)
Algebra and Trigonometry (6th Edition)
Algebra
ISBN:
9780134463216
Author:
Robert F. Blitzer
Publisher:
PEARSON
Contemporary Abstract Algebra
Contemporary Abstract Algebra
Algebra
ISBN:
9781305657960
Author:
Joseph Gallian
Publisher:
Cengage Learning
Linear Algebra: A Modern Introduction
Linear Algebra: A Modern Introduction
Algebra
ISBN:
9781285463247
Author:
David Poole
Publisher:
Cengage Learning
Algebra And Trigonometry (11th Edition)
Algebra And Trigonometry (11th Edition)
Algebra
ISBN:
9780135163078
Author:
Michael Sullivan
Publisher:
PEARSON
Introduction to Linear Algebra, Fifth Edition
Introduction to Linear Algebra, Fifth Edition
Algebra
ISBN:
9780980232776
Author:
Gilbert Strang
Publisher:
Wellesley-Cambridge Press
College Algebra (Collegiate Math)
College Algebra (Collegiate Math)
Algebra
ISBN:
9780077836344
Author:
Julie Miller, Donna Gerken
Publisher:
McGraw-Hill Education