|
|
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
Track
Your Progress
Practice
Pays
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
23 Feb 2018, 23:48
Kudos
Bookmarks
A
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!
Difficulty:
95%
(hard)
Question Stats:
34% (02:40) correct
66%
(02:27)
wrong
based on 215
sessions
History
Date
Time
Result
Not Attempted Yet
In a recently held cricket tournament in one of the universities in Australia, 'N' teams participated in total. The tournament comprised of various rounds, where each round comprised of one or more 'games'. Each 'game' was always between two teams only, and the rules were designed as such that each 'game' resulted in a Win for one team and Loss for the other team, there were no Draws.
What is the value of 'N'?
(1) In the first round of the tournament, each team played a game with every other team, and no two teams played each other more than once. This way, '28' games in total were played in round 1.
(2) Out of 'N', 4 teams were selected after round 1 for round 2, where '2' games were played in total; and 2 teams were selected from round 2 for round 3, where there was only '1' game played that declared the winner. Thus, tournament was over in 3 rounds. This way, in total, '31' games were played in the entire tournament.
What is the value of 'N'?
(1) In the first round of the tournament, each team played a game with every other team, and no two teams played each other more than once. This way, '28' games in total were played in round 1.
(2) Out of 'N', 4 teams were selected after round 1 for round 2, where '2' games were played in total; and 2 teams were selected from round 2 for round 3, where there was only '1' game played that declared the winner. Thus, tournament was over in 3 rounds. This way, in total, '31' games were played in the entire tournament.
24 Feb 2018, 02:26
Kudos
Bookmarks
amanvermagmat
We're asked to find the number of teams.
Let's see which statements give us relevant information, a Logical approach.
(1) This gives us an equation with one variable: N choose 2 = 28 and is therefore solvable.
Sufficient!
(2) so we know that the first round had 31 - 1 - 2 = 28 games but we don't know how they were distributed amongst the teams.
Therefore we cannot create an equation connecting the number of teams to the number of games in round 1.
Insufficient.
(A) is our answer.
08 Mar 2018, 01:20
Kudos
Bookmarks
Hi, I have a question.
For statement 1: Do we assume that all teams in the tournament participated in Round 1 of the tournament or some teams will skip round 1 as they are directly qualify for the 2nd round. As round 1 could be just qualifier rounds for selected under-dog teams, out of which X teams will be selected and join the other directly qualified teams in Round 2.
Can someone please help? I feel little bit confused. Sorry i may sound silly. But just to get clarified, in case CAT throws me such questions on my D-Day
Thanks.
For statement 1: Do we assume that all teams in the tournament participated in Round 1 of the tournament or some teams will skip round 1 as they are directly qualify for the 2nd round. As round 1 could be just qualifier rounds for selected under-dog teams, out of which X teams will be selected and join the other directly qualified teams in Round 2.
Can someone please help? I feel little bit confused. Sorry i may sound silly. But just to get clarified, in case CAT throws me such questions on my D-Day
Thanks.
