Last visit was: 24 Apr 2026, 13:03 It is currently 24 Apr 2026, 13:03
Close
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
Your Progress

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.
Close
Request Expert Reply
Confirm Cancel
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 24 Apr 2026
Posts: 109,820
Own Kudos:
Given Kudos: 105,873
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 109,820
Kudos: 811,060
 [31]
6
Kudos
Add Kudos
25
Bookmarks
Bookmark this Post
Most Helpful Reply
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 24 Apr 2026
Posts: 109,820
Own Kudos:
811,060
 [6]
Given Kudos: 105,873
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 109,820
Kudos: 811,060
 [6]
4
Kudos
Add Kudos
2
Bookmarks
Bookmark this Post
General Discussion
avatar
sudh
Joined: 15 May 2014
Last visit: 18 Jun 2021
Posts: 59
Own Kudos:
156
 [2]
Given Kudos: 11
Posts: 59
Kudos: 156
 [2]
2
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
Zhenek
Joined: 17 Mar 2015
Last visit: 08 Jun 2021
Posts: 104
Own Kudos:
300
 [1]
Given Kudos: 4
Posts: 104
Kudos: 300
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Since we aren't told about how the games are played, lets just imagine that every division's group represents a linked N-angle polygon. When you go by the edges of it, like on the picture below, you can easily determine that for N teams you have to play max 2*N - 1 games to determine a winner and I honestly can't think of an approach to play more games (although you can play 1 less game if you connect all non-adjacent vertexes and call them "games", this way you will get 2*N - 2 games, but its irrelevant I guess)
Numbers are games, vertexes are teams

For the last part you can also use that polygon approach which provided 1 loss is elimination easily gives us answer N - 1 where N - amount of teams (4 as a result). Resulting answer ends up being
2(6 + 9 + 12 + 13 + 14) - 5 + 4 = 107 which corresponds to answer D
User avatar
u1983
User avatar
Current Student
Joined: 24 Aug 2016
Last visit: 06 Jun 2021
Posts: 700
Own Kudos:
873
 [1]
Given Kudos: 97
GMAT 1: 540 Q49 V16
GMAT 2: 680 Q49 V33
Products:
GMAT 2: 680 Q49 V33
Posts: 700
Kudos: 873
 [1]
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
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
User avatar
Regor60
Joined: 21 Nov 2021
Last visit: 19 Apr 2026
Posts: 529
Own Kudos:
Given Kudos: 462
Posts: 529
Kudos: 420
Kudos
Add Kudos
Bookmarks
Bookmark this Post
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
User avatar
bumpbot
User avatar
Non-Human User
Joined: 09 Sep 2013
Last visit: 04 Jan 2021
Posts: 38,976
Own Kudos:
Posts: 38,976
Kudos: 1,117
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Automated notice from GMAT Club BumpBot:

A member just gave Kudos to this thread, showing it’s still useful. I’ve bumped it to the top so more people can benefit. Feel free to add your own questions or solutions.

This post was generated automatically.
Moderators:
Math Expert
109820 posts
Tuck School Moderator
853 posts