Last visit was: 21 May 2024, 04:44 It is currently 21 May 2024, 04:44
Toolkit
GMAT Club Daily Prep
Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized
for You

we will pick new questions that match your level based on your Timer History

Track

every week, we’ll send you an estimated GMAT score based on your performance

Practice
Pays

we will pick new questions that match your level based on your Timer History
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.

# This game season, five divisions are going to play. Out of all the tea

SORT BY:
Tags:
Show Tags
Hide Tags
Math Expert
Joined: 02 Sep 2009
Posts: 93365
Own Kudos [?]: 625479 [23]
Given Kudos: 81917
Manager
Joined: 15 May 2014
Posts: 59
Own Kudos [?]: 133 [1]
Given Kudos: 11
Manager
Joined: 17 Mar 2015
Posts: 106
Own Kudos [?]: 213 [1]
Given Kudos: 4
Math Expert
Joined: 02 Sep 2009
Posts: 93365
Own Kudos [?]: 625479 [3]
Given Kudos: 81917
Re: This game season, five divisions are going to play. Out of all the tea [#permalink]
2
Kudos
1
Bookmarks
Bunuel wrote:
This game season, five divisions are going to play. Out of all the teams in each division, 6, 9, 12, 13 and 14 teams have qualified from the respective divisions. Each division will hold its own tournament – where a team is eliminated from the tournament upon losing two games – in order to determine its champion. The five division champions will then play in a knock-off tournament – a team is eliminated as soon as it loses a game – in order to determine the overall champion. Assuming that there were no ties and no forfeits, what is the maximum number of games that could have been played in order to determine the overall league champion?

(A) 89
(B) 100
(C) 102
(D) 107
(E) 112

Kudos for a correct solution.

VERITAS PRGEP OFFICIAL SOLUTION:

Is it a max-min problem? Perhaps, but which guiding principle of max-min will we use to solve this problem? First think on your own how you will solve this problem.

Will you focus on the method or the result i.e. will you worry about who plays against whom or just focus on each result which gives one loss and one win? If you don’t worry about the method and just focus on the result, you can use a concept of mixtures here. In mixture questions, we focus on one component and how it changes. Here, we need to keep track of losses. Let’s focus on those and forget about the wins. As given, there were no ties so every loss has a win on the other side.

Every time a game is played, someone loses. We can give at most 2 losses to a team since after that it is out of the tournament. Don’t worry about against who it plays those two games. Whenever a team loses 2 games, it is out. The team could have won many games but we are not counting the wins and hence, are not concerned about its wins. As discussed, we are counting the losses so each win of that team will be counted on the other side i.e. as a loss for the other team.

Consider the division which has 6 teams – what happens when 12 games are played? There are 12 losses and each team gets 2 losses (we can’t give more than 2 to a team since the team gets kicked out after 2 losses), so all are out of the tournament. But we need a winner so we play only 11 games so that the winning team gets only 1 loss. We want to maximize the losses (and hence the number of games), therefore the winning team must be given a loss too.

So maximum number of games that can be played by the district in its own tournament = 2*6 – 1 = 11

Similarly, the division with 9 teams can play at most 2*9 – 1 = 17 games.

The division with 12 teams can play at most 2*12 – 1 = 23 games.

The division with 13 teams can play at most 2*13 – 1 = 25 games.

The division with 14 teams can play at most 2*14 – 1 = 27 games.

This totals up to 11 + 17 + 23 + 25 + 27 = 103 games

Now we come to the games between the district champions.

We have 5 teams. 1 loss gets a team kicked out. If the teams play 4 games, there are 4 losses and 4 teams get kicked out. We have a final winner!

Hence the total number of games = 103 + 4 = 107

There are a lot of variations you can consider for this question.

Say, if we need to minimize the number of games, how many total games would have been played?

Notice that the only games you can avoid are the ones in which the 5 district champions lost. You do still need 2 losses for each team to get the district champion and one loss each for four district champions to get the winner. Hence, at least 107 – 5 = 102 games need to be played.

Look at it in another way:

To kick out a team, it needs to have 2 losses so if the district had 6 teams, there would be 5*2 = 10 games played.

Similarly, the division with 9 teams will play at least 2*8 = 16 games.

The division with 12 teams will play at least 2*11 = 22 games.

The division with 13 teams will play at least 2*12 = 24 games.

The division with 14 teams will play at least 2*13 = 26 games.

This totals up to 10 + 16 + 22 + 24 + 26 = 98 games

Now we have 5 champions and they will need to play at least 4 games to pick a winner.

Therefore, at least 98 + 4 = 102 games need to be played.

You can try other similar variations – what happens when a team is kicked out after it loses 3 games instead of 2? What happens if you don’t have the knock-off tournament and instead need each district champion to lose 2 games to get knocked out?
Current Student
Joined: 24 Aug 2016
Posts: 733
Own Kudos [?]: 775 [0]
Given Kudos: 97
GMAT 1: 540 Q49 V16
GMAT 2: 680 Q49 V33
This game season, five divisions are going to play. Out of all the tea [#permalink]
Anecdote : Rewinding back long.... 1st day class on permutation & combination at school - The teacher asked : In a knockout tournament there are 64 teams , how many matches to be played to determine champion?All of the students started to draw fixture table and start counting ...... in around 5 mins ....... the teacher interrupted the effort. And explained the logic:
LOOK AT THE WAYS TO LOOSE to win this battle.

Final Phase : 5 teams , any team looses once get eliminated. so to remain with 1 team we need 4 looser. Hence 4 matches.

Div 01: 6 teams , Each team looses 2 times get eliminated and if looses only once , thats ok... so to maximise = 5 team will loose 2 ans 1 team will loose 1 . Hence (6-1)*2+1 =11 matches
Div 02: 9 teams , similar logic... so to maximise = 8 team will loose 2 ans 1 team will loose 1 . Hence (9-1)*2+1 =17 matches
Div 03: 12 teams , similar logic... so to maximise = 8 team will loose 2 ans 1 team will loose 1 . Hence (12-1)*2+1 =23 matches
Div 04: 13 teams , similar logic... so to maximise = 8 team will loose 2 ans 1 team will loose 1 . Hence (13-1)*2+1 =25 matches
Div 05: 14 teams , similar logic... so to maximise = 8 team will loose 2 ans 1 team will loose 1 . Hence (14-1)*2+1 =27 matches

SO total matches : 4+11+17+23+25+27 = 107....Ans D
Senior Manager
Joined: 21 Nov 2021
Posts: 448
Own Kudos [?]: 222 [0]
Given Kudos: 357
This game season, five divisions are going to play. Out of all the tea [#permalink]
Simplify to determine pattern.

Three teams, abc. Games:

ab ac bc for 3 games.

Each team loses 1 game. Next round:

Team 'a' loses its game, for example. 4 games played total. 'a' eliminated.

Last game b versus c.

Total of 5 games among three teams to determine winner.

Using above approach for 4 teams will show 7 games to determine winner.

Pattern: 2n-1 where n=number of teams.

So division games would be:

2*6-1=11
2*9-1=17
2*12-1=23
2*13-1=25
2*14-1=27

Total games to determine 5 division winners:

103

Laying out the 10 potential games among the 5 to determine overall winner is straightforward, with, for example, 'a' losing its game against 'b' eliminating a's remaining potential games, etcetera.

The total games to identify the overall winner being

5-1 = 4

And maximum number of games overall being:

103+4 = 107

Posted from my mobile device
This game season, five divisions are going to play. Out of all the tea [#permalink]
Moderator:
Math Expert
93365 posts