Forum Home > GMAT > Quantitative > Problem Solving (PS)
Events & Promotions
|
|
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.
Dec 1310:00 AM EST
-12:00 PM EST
Have you ever wondered how to score a PERFECT 805 on the GMAT? Meet Julia, a banking professional who used the Target Test Prep course to achieve this incredible feat. Julia's story is nothing short of an inspiration.
Dec 1410:00 AM EST
-12:00 PM EST
Think a 100% GMAT Verbal score is out of your reach? Target Test Prep will make you think again! Our course uses techniques such as topical study and spaced repetition to maximize knowledge retention and make studying simple and fun.
Dec 1411:00 AM IST
-01:00 PM IST
Attend this session to learn how to Deconstruct arguments, Pre-Think Author’s Assumptions, and apply Negation Test.- Dec 15
11:00 AM IST
-01:00 PM IST
Attend this free GMAT Algebra Webinar and learn how to master the most challenging Inequalities and Absolute Value problems with ease. 
Dec 1608:00 AM PST
-11:59 PM PST
GMAT Club 12 Days of Christmas is a 4th Annual GMAT Club Winter Competition based on solving questions. This is the Winter GMAT competition on GMAT Club with an amazing opportunity to win over $40,000 worth of prizes!
14 Oct 2019, 18:08
Kudos
Bookmarks
D
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!
Difficulty:
75%
(hard)
Question Stats:
59% (02:58) correct
41%
(02:42)
wrong
based on 100
sessions
History
Date
Time
Result
Not Attempted Yet
Players from only two countries \(C_1\) and \(C_2\) participated in a UNO tournament. Each game of the tournament involved 3 players and no two games had the same set of 3 players. The number of games involving only \(C_1\) players was 455 and the number of games involving only \(C_2\) players was 120. If the total number of games played in the tournament was maximum possible, then how many games involved at least one player each from \(C_1\) and \(C_2\)?
A. 1650
B. 1675
C. 1700
D. 1725
E. 1750
A. 1650
B. 1675
C. 1700
D. 1725
E. 1750
14 Oct 2019, 18:51
Kudos
Bookmarks
nick1816
Players from only two countries \(C_1\) and \(C_2\) participated in a UNO tournament. Each game of the tournament involved 3 players and no two games had the same set of 3 players. The number of games involving only \(C_1\) players was 455 and the number of games involving only \(C_2\) players was 120. If the total number of games played in the tournament was maximum possible, then how many games involved at least one player each from \(C_1\) and \(C_2\)?
A. 1650
B. 1675
C. 1700
D. 1725
E. 1750
A. 1650
B. 1675
C. 1700
D. 1725
E. 1750
So, the game can involve any of the players of any of the two countries..
Since 455 games were played by C1 country, this should give us the number of players of C1..
Let the number of players be n, so \(nC3=455..\frac{.n(n-1)(n-2)}{3!}=455=5*7*13...n(n-1)(n-2)=5*7*13*2*3=13*14*15...n=15\)
Since 120 games were played by C2 country, this should give us the number of players of C2..
Let the number of players be x, so \(xC3=120..\frac{.n(n-1)(n-2)}{3!}=120=4*3*10...n(n-1)(n-2)=3*4*10*2*3=8*9*10...x=10\)
Now there are two ways to have atleast one player of each team..
1) 2 from C1 and 1 from C2 = 15C2*10C1=15*7*10=1050
2) 1 from C1 and 2 from C2 = 15C1*10C2=15*5*9=675
Total = 1050+675=1725
D
13 Nov 2019, 06:07
Kudos
Bookmarks
nick1816
Players from only two countries \(C_1\) and \(C_2\) participated in a UNO tournament. Each game of the tournament involved 3 players and no two games had the same set of 3 players. The number of games involving only \(C_1\) players was 455 and the number of games involving only \(C_2\) players was 120. If the total number of games played in the tournament was maximum possible, then how many games involved at least one player each from \(C_1\) and \(C_2\)?
A. 1650
B. 1675
C. 1700
D. 1725
E. 1750
A. 1650
B. 1675
C. 1700
D. 1725
E. 1750
\(C_1=x…C_2=y\)
CASES ONLY PLAYERS OF ONE GROUP
\([XXX]:xC3=455…\frac{x!}{(x-3)!3!}=455…\frac{x(x-1)(x-2)(x-3)!}{(x-3)!}=455*6…x(x-1)(x-2)=(15)(14)(13)…x=15\)
\([YYY]:yC3=120…\frac{y!}{(y-3)!3!}=120…\frac{y(y-1)(y-2)(y-3)!}{(y-3)!}=720…y(y-1)(y-2)=(10)(9)(8)…y=10\)
CASES AT LEAST ONE EACH GROUP
\([XXY]:xC2•yC1=15C2•10C1=15!/13!2!•10=15*7•10=1050\)
\([XYY]:xC1•yC2=15C1•10C2=15•10!/8!2!=15•5*9=675\)
\([XXY]+[XYY]=1050+675=1725\)
Ans (D)
