Oct 14 08:00 PM PDT  11:00 PM PDT Join a 4day FREE online boot camp to kick off your GMAT preparation and get you into your dream bschool in R2.**Limited for the first 99 registrants. Register today! Oct 15 12:00 PM PDT  01:00 PM PDT Join this live GMAT class with GMAT Ninja to learn to conquer your fears of long, kooky GMAT questions. Oct 16 08:00 PM PDT  09:00 PM PDT EMPOWERgmat is giving away the complete Official GMAT Exam Pack collection worth $100 with the 3 Month Pack ($299) Oct 19 07:00 AM PDT  09:00 AM PDT Does GMAT RC seem like an uphill battle? eGMAT is conducting a free webinar to help you learn reading strategies that can enable you to solve 700+ level RC questions with at least 90% accuracy in less than 10 days. Sat., Oct 19th at 7 am PDT Oct 20 07:00 AM PDT  09:00 AM PDT Get personalized insights on how to achieve your Target Quant Score.
Author 
Message 
TAGS:

Hide Tags

Math Expert
Joined: 02 Sep 2009
Posts: 58320

A certain game pays players in tokens, each of which is worth either m
[#permalink]
Show Tags
11 May 2015, 06:07
Question Stats:
32% (02:24) correct 68% (02:36) wrong based on 117 sessions
HideShow timer Statistics
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.
Official Answer and Stats are available only to registered users. Register/ Login.
_________________




Math Expert
Joined: 02 Sep 2009
Posts: 58320

Re: A certain game pays players in tokens, each of which is worth either m
[#permalink]
Show Tags
18 May 2015, 08:56
Bunuel wrote: 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. 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) mpoint 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) npoint 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 3point 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 2point tokens; three 2point tokens and two 3point tokens; and four 3point tokens. This answer is not correct. (D) A sum of 10 points can be paid out in two ways: five 2point tokens, or two 2point tokens and two 3point tokens. This answer is not correct. (B) A sum of 7 points can be paid out only as two 2point tokens and one 3point token. This answer is the largest one left with a unique combination, so it is the correct answer. The correct answer is (B).
_________________




Manager
Joined: 17 Mar 2015
Posts: 115

Re: A certain game pays players in tokens, each of which is worth either m
[#permalink]
Show Tags
12 May 2015, 01:08
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 mworth chips used A)2*a + 3*b = 2*2*31 = 11 = 2*4+3*1 = 2*1+3*2  fail B)2*a+3*b = 2*2*323 = 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+31 = 10 = 2*2+ 3*2 = 5*2 + 3*0  fail E)2*a+3*b = 6  2 3 = 1  fail
B that is then.



Senior Manager
Joined: 21 Jan 2015
Posts: 458
Location: India
Concentration: Strategy, Marketing
GMAT 1: 620 Q48 V28 GMAT 2: 690 Q49 V35
WE: Sales (Consumer Products)

Re: A certain game pays players in tokens, each of which is worth either m
[#permalink]
Show Tags
12 May 2015, 21:49
Bunuel wrote: 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 – 1
B) 2mn – m – n
C) 2mn – m – n – 1
D) mn + m + n – 1
E) mn – m – n
Kudos for a correct solution. Ans: (A) I am not sure if I am right. this is how i thought of it. as question says highest common factor is 1 means these two do not have any common factor. so lets say M=x*y and N=a*b where x,y,a and b are different prime numbers. so now putting these conditions in all the options 1. 2mn1 = 2xyab1 this can have any value but no two different combinations are possible for the same value. 2. 2mn – m – n = 2xyabxyab = xy(2abab1) = xy(ab1) OR 2xyabxyab = ab(2xyxy1) = ab(xy1) two different combinations are possible. same way we can do for all options and the Ans: A
_________________
 The Mind is Everything, What we Think we Become.



Manager
Joined: 07 Apr 2015
Posts: 154

Re: A certain game pays players in tokens, each of which is worth either m
[#permalink]
Show Tags
13 May 2015, 01:31
dkumar2012 wrote: Bunuel wrote: 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 – 1
B) 2mn – m – n
C) 2mn – m – n – 1
D) mn + m + n – 1
E) mn – m – n
Kudos for a correct solution. Ans: (A) I am not sure if I am right. this is how i thought of it. as question says highest common factor is 1 means these two do not have any common factor. so lets say M=x*y and N=a*b where x,y,a and b are different prime numbers. so now putting these conditions in all the options 1. 2mn1 = 2xyab1 this can have any value but no two different combinations are possible for the same value. 2. 2mn – m – n = 2xyabxyab = xy(2abab1) = xy(ab1) OR 2xyabxyab = ab(2xyxy1) = ab(xy1) two different combinations are possible. same way we can do for all options and the Ans: A If two numbers have a GCF of 1 this does not necessary imply that those numbers itself are prime. http://mathworld.wolfram.com/RelativelyPrime.htmlThey are relatively prime, just for your information. Not sure if that changes the approach.



Senior Manager
Joined: 21 Jan 2015
Posts: 458
Location: India
Concentration: Strategy, Marketing
GMAT 1: 620 Q48 V28 GMAT 2: 690 Q49 V35
WE: Sales (Consumer Products)

Re: A certain game pays players in tokens, each of which is worth either m
[#permalink]
Show Tags
13 May 2015, 02:10
noTh1ng wrote: If two numbers have a GCF of 1 this does not necessary imply that those numbers itself are prime. http://mathworld.wolfram.com/RelativelyPrime.htmlThey are relatively prime, just for your information. Not sure if that changes the approach. I did not say that they are prime but they don't have any common factors with each other except 1. which is given. i hope i am getting it right.
_________________
 The Mind is Everything, What we Think we Become.



Manager
Joined: 05 Mar 2013
Posts: 54
Location: United States
Schools: Wharton '17, Kellogg '17, Booth '17, Ross '17, Haas '17, Tuck '17, Yale '17, Duke '17, Anderson '17, Johnson '17, Kelley '17, McDonough '17, Goizueta '17
GPA: 3.56
WE: Marketing (Telecommunications)

Re: A certain game pays players in tokens, each of which is worth either m
[#permalink]
Show Tags
16 May 2015, 23:54
i plugged in numbers for this m=3 and n=5 and i got C as the answer



Intern
Joined: 06 Oct 2013
Posts: 45

Re: A certain game pays players in tokens, each of which is worth either m
[#permalink]
Show Tags
16 Aug 2015, 07:11
Bunuel wrote: Bunuel wrote: 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. 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) mpoint 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) npoint 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 3point 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 2point tokens; three 2point tokens and two 3point tokens; and four 3point tokens. This answer is not correct. (D) A sum of 10 points can be paid out in two ways: five 2point tokens, or two 2point tokens and two 3point tokens. This answer is not correct. (B) A sum of 7 points can be paid out only as two 2point tokens and one 3point token. This answer is the largest one left with a unique combination, so it is the correct answer. The correct answer is (B). Can anyone please explain the highlighted part. why (n1) , why not (n2) or (n3).... is it because greatest common factor 1.



Manager
Joined: 01 Sep 2016
Posts: 189

Re: A certain game pays players in tokens, each of which is worth either m
[#permalink]
Show Tags
20 Sep 2017, 13:23
Bunuel wrote: 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. Here is my take on this question. After looking at the question, I realized that solving it the typical algebrical way would be hard. So I rather moved backward from option choices. First and foremost take some sample numbers. Why not start with m=3 and n=2. Now lets get to option choices: A) 2mn = 12, ahaa you have two combinations right away 3*4 or 2*6. So this can't be true. B) 2mn  m n : 1223=7, now how can you get 7 using 2s and 3s? Only one way: 2*(2) + 1*(3). There is no other way to get this value. You can try it yourselves. Most likely answer, but lets check if any other option gives an even higher value using one unique combination as the question asks for the greatest possible sum. C) 2mnmn1= 6, now right away you have 2 possible combinations. One way is to do 2*(3) and the other way is to do 3*(2). Hence this is wrong too. D) mn + m+ n1= 10, One way is to do 2*(2) + 2*(3), and the other way is to simply do five times 2. Hence this is also wrong. E) mn  m  n= 1, there is no way to get this. Hence wrong CORRECT ANSWER IS B
_________________
we shall fight on the beaches, we shall fight on the landing grounds, we shall fight in the fields and in the streets, we shall fight in the hills; we shall never surrender!



Target Test Prep Representative
Status: Founder & CEO
Affiliations: Target Test Prep
Joined: 14 Oct 2015
Posts: 8041
Location: United States (CA)

Re: A certain game pays players in tokens, each of which is worth either m
[#permalink]
Show Tags
23 Apr 2019, 20:09
Bunuel wrote: 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. Like the example given in the problem, we can let m = 2 and n = 3 and analyze each answer choice: A) 2mn = 2(2)(3) = 12 However, 12 = 6m + 0n or 0m + 4n. B) 2mn  m  n = 2(2)(3)  2  3 = 7 We see that 7 = 2m + n only. We can skip choices C and E since the value of those expressions will be less than that of choice B and we are looking for the greatest possible sum. D) mn + m + n  1 = 2(3) + 2 + 3  1 = 10 However, 10 = 5m + 0n or 2m + 2n. Answer: B
_________________
5star rated online GMAT quant self study course See why Target Test Prep is the top rated GMAT quant course on GMAT Club. Read Our Reviews If you find one of my posts helpful, please take a moment to click on the "Kudos" button.




Re: A certain game pays players in tokens, each of which is worth either m
[#permalink]
23 Apr 2019, 20:09






