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.
Jun 3008:00 AM PDT
-11:59 PM PDT
Join us June 30th for 2 weeks of GMAT questions (just 8 per day) to help with your prep and to compete with your fellow GMAT Clubbers for a chance to win a prize fund of $30,000 for you and your team-mates!
Jul 0901:00 PM EDT
-02:00 PM EDT
More Target Test Prep students are earning 100th percentile GMAT scores. Don’t settle for less when the Target Test Prep course gives you everything you need to score high on the GMAT. Start your 5-day free trial today.
Jul 1206:30 AM PDT
-08:30 AM PDT
Join our webinar to master GMAT RC Main Point Questions! Learn effective strategies to decipher passage themes and purposes. Senior Verbal Expert- Sunita Singhvi will equip you with tools to navigate complexities and avoid common traps set by the GMAT.
Jul 1211: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.
Jul 1311:00 AM EDT
-12:30 PM EDT
Looking for your GMAT motivation to break through the score plateau? Pragati improved her score by massive 160 points with strategic guidance and hard-work! Find out how personalized mentorship and a strong mindset can turn GMAT struggles into success.
Jul 1508:00 PM PDT
-09:00 PM PDT
Full-length FE mock with insightful analytics, weakness diagnosis, and video explanations!
Jul 1611:00 AM EDT
-12:00 PM EDT
Prefer video-based learning? The Target Test Prep OnDemand course is a one-of-a-kind video masterclass featuring 400 hours of lecture-style teaching by Scott Woodbury-Stewart, founder of Target Test Prep and one of the most accomplished GMAT instructors.
11 May 2015, 06:07
Kudos
Bookmarks
B
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:
33% (02:38) correct
67%
(02:42)
wrong
based on 237
sessions
History
Date
Time
Result
Not Attempted Yet
A certain game pays players in tokens, each of which is worth either m points or n points, where m and n are different positive integers whose greatest common factor is 1. In terms of m and n, what is the greatest possible sum, in points, that can be paid out with only one unique combination of these tokens? (For example, if m = 2 and n = 3, then a sum of 5 points can be created using only one combination, m + n, which is a unique combination. By contrast, a sum of 11 points can be created by 4m + n or by m + 3n. This solution does not represent a unique combination; two combinations are possible.)
A) 2mn
B) 2mn – m – n
C) 2mn – m – n – 1
D) mn + m + n – 1
E) mn – m – n
Kudos for a correct solution.
A) 2mn
B) 2mn – m – n
C) 2mn – m – n – 1
D) mn + m + n – 1
E) mn – m – n
Kudos for a correct solution.
18 May 2015, 08:56
Kudos
Bookmarks
Bunuel
A certain game pays players in tokens, each of which is worth either m points or n points, where m and n are different positive integers whose greatest common factor is 1. In terms of m and n, what is the greatest possible sum, in points, that can be paid out with only one unique combination of these tokens? (For example, if m = 2 and n = 3, then a sum of 5 points can be created using only one combination, m + n, which is a unique combination. By contrast, a sum of 11 points can be created by 4m + n or by m + 3n. This solution does not represent a unique combination; two combinations are possible.)
A) 2mn
B) 2mn – m – n
C) 2mn – m – n – 1
D) mn + m + n – 1
E) mn – m – n
Kudos for a correct solution.
A) 2mn
B) 2mn – m – n
C) 2mn – m – n – 1
D) mn + m + n – 1
E) mn – m – n
Kudos for a correct solution.
MANHATTAN GMAT OFFICIAL SOLUTION:
Multiple combinations are created when you can “exchange” a set of m tokens worth n points each for a set of n tokens worth m points each. In the example given in the problem, the first solution uses 4 m’s (worth 8 points total) and one n (worth 3 points) to reach 11 points. The second solution is created when 3 m’s (worth 2 points each, for a total of 6 points) are exchanged for 2 n’s (worth 3 points each, for a total of 6 points), leading to the new solution m + 3n.
The question asks for a sum with a unique solution, or a solution for which such an “exchange” is not possible. What must be true of this kind of solution?
The payout may include no more than (n – 1) m-point tokens. (If there were n of them, they could be exchanged to make a different combination.)
The payout may include no more than (m – 1) n-point tokens. (If there were m of them, they could be exchanged to make a different combination.)
The question asks for the greatest possible such sum, so use the maximum possible number of m and n tokens, as determined above:
(n – 1)(m) + (m – 1)(n)
= mn – m + mn – n
= 2mn – m – n.
Alternatively, try plugging in numbers. For instance, if m = 2 and n = 3, then you’re looking for the greatest possible sum that can be paid with a unique combination of 2- and 3-point tokens. That sum must be one of the answer choices, so check the sums in the answer choices and stop at the highest one with a unique payout combination.
With m = 2 and n = 3, the answer choices are (A) 12 points, (B) 7 points, (C) 6 points, (D) 10 points, (E) 1 point. Try them in decreasing order (because the problem asks for the greatest sum):
(A) A sum of 12 points can be paid out in three ways: six 2-point tokens; three 2-point tokens and two 3-point tokens; and four 3-point tokens. This answer is not correct.
(D) A sum of 10 points can be paid out in two ways: five 2-point tokens, or two 2-point tokens and two 3-point tokens. This answer is not correct.
(B) A sum of 7 points can be paid out only as two 2-point tokens and one 3-point token. This answer is the largest one left with a unique combination, so it is the correct answer.
The correct answer is (B).
General Discussion
12 May 2015, 01:08
Kudos
Bookmarks
I wonder if thats an adequate way to solve this but I literally just plugged the very same numbers in the task as in m = 2 and n = 3. a and b ar variables corresponding to the amount of n and m-worth chips used
A)2*a + 3*b = 2*2*3-1 = 11 = 2*4+3*1 = 2*1+3*2 - fail
B)2*a+3*b = 2*2*3-2-3 = 7 = 2*2+3*1 - looks good, that means any answer below 7 is incorrect.
C)2*a+3*b = 6 = incorrect (less than 7)
D)2*a+3*b = 2*3+2+3-1 = 10 = 2*2+ 3*2 = 5*2 + 3*0 - fail
E)2*a+3*b = 6 - 2 -3 = 1 - fail
B that is then.
A)2*a + 3*b = 2*2*3-1 = 11 = 2*4+3*1 = 2*1+3*2 - fail
B)2*a+3*b = 2*2*3-2-3 = 7 = 2*2+3*1 - looks good, that means any answer below 7 is incorrect.
C)2*a+3*b = 6 = incorrect (less than 7)
D)2*a+3*b = 2*3+2+3-1 = 10 = 2*2+ 3*2 = 5*2 + 3*0 - fail
E)2*a+3*b = 6 - 2 -3 = 1 - fail
B that is then.
