Last visit was: 11 Jul 2025, 05:42 It is currently 11 Jul 2025, 05:42
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: 11 Jul 2025
Posts: 102,634
Own Kudos:
Given Kudos: 98,170
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 102,634
Kudos: 740,348
 [25]
1
Kudos
Add Kudos
24
Bookmarks
Bookmark this Post
Most Helpful Reply
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 11 Jul 2025
Posts: 102,634
Own Kudos:
Given Kudos: 98,170
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 102,634
Kudos: 740,348
 [10]
3
Kudos
Add Kudos
7
Bookmarks
Bookmark this Post
General Discussion
User avatar
Zhenek
Joined: 17 Mar 2015
Last visit: 08 Jun 2021
Posts: 106
Own Kudos:
277
 [2]
Given Kudos: 4
Posts: 106
Kudos: 277
 [2]
2
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
D3N0
Joined: 21 Jan 2015
Last visit: 11 July 2025
Posts: 583
Own Kudos:
Given Kudos: 123
Location: India
Concentration: Operations, Technology
GMAT 1: 620 Q48 V28
GMAT 2: 690 Q49 V35
WE:Operations (Retail: E-commerce)
Products:
GMAT 2: 690 Q49 V35
Posts: 583
Kudos: 499
Kudos
Add Kudos
Bookmarks
Bookmark this Post
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 – 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. 2mn-1 = 2xyab-1 this can have any value but no two different combinations are possible for the same value.
2. 2mn – m – n = 2xyab-xy-ab = xy(2ab-ab-1) = xy(ab-1)
--------OR
2xyab-xy-ab = ab(2xy-xy-1) = ab(xy-1)
two different combinations are possible.
same way we can do for all options and
the Ans: A
avatar
noTh1ng
Joined: 07 Apr 2015
Last visit: 06 Jan 2017
Posts: 126
Own Kudos:
201
 [1]
Given Kudos: 185
Posts: 126
Kudos: 201
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
dkumar2012
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 – 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. 2mn-1 = 2xyab-1 this can have any value but no two different combinations are possible for the same value.
2. 2mn – m – n = 2xyab-xy-ab = xy(2ab-ab-1) = xy(ab-1)
--------OR
2xyab-xy-ab = ab(2xy-xy-1) = ab(xy-1)
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. https://mathworld.wolfram.com/RelativelyPrime.html

They are relatively prime, just for your information. Not sure if that changes the approach.
User avatar
D3N0
Joined: 21 Jan 2015
Last visit: 11 July 2025
Posts: 583
Own Kudos:
Given Kudos: 123
Location: India
Concentration: Operations, Technology
GMAT 1: 620 Q48 V28
GMAT 2: 690 Q49 V35
WE:Operations (Retail: E-commerce)
Products:
GMAT 2: 690 Q49 V35
Posts: 583
Kudos: 499
Kudos
Add Kudos
Bookmarks
Bookmark this Post
noTh1ng

If two numbers have a GCF of 1 this does not necessary imply that those numbers itself are prime. https://mathworld.wolfram.com/RelativelyPrime.html

They 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.
avatar
Udai
Joined: 05 Mar 2013
Last visit: 03 Jan 2017
Posts: 37
Own Kudos:
Given Kudos: 12
Location: United States
GMAT 1: 670 Q49 V33
GPA: 3.56
WE:Marketing (Telecommunications)
Kudos
Add Kudos
Bookmarks
Bookmark this Post
i plugged in numbers for this m=3 and n=5 and i got C as the answer
User avatar
AdlaT
Joined: 06 Oct 2013
Last visit: 12 May 2017
Posts: 38
Own Kudos:
Given Kudos: 34
Posts: 38
Kudos: 155
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Bunuel
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.

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).


Can anyone please explain the highlighted part. why (n-1) , why not (n-2) or (n-3)....

is it because greatest common factor 1.
User avatar
bkpolymers1617
Joined: 01 Sep 2016
Last visit: 11 Dec 2017
Posts: 125
Own Kudos:
Given Kudos: 33
GMAT 1: 690 Q49 V35
Products:
GMAT 1: 690 Q49 V35
Posts: 125
Kudos: 1,186
Kudos
Add Kudos
Bookmarks
Bookmark this Post
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.


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 : 12-2-3=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) 2mn-m-n-1= 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+ n-1= 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
User avatar
ScottTargetTestPrep
User avatar
Target Test Prep Representative
Joined: 14 Oct 2015
Last visit: 10 Jul 2025
Posts: 21,070
Own Kudos:
Given Kudos: 296
Status:Founder & CEO
Affiliations: Target Test Prep
Location: United States (CA)
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 21,070
Kudos: 26,130
Kudos
Add Kudos
Bookmarks
Bookmark this Post
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.

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
avatar
Engineer1
Joined: 01 Jan 2014
Last visit: 15 Jun 2025
Posts: 207
Own Kudos:
Given Kudos: 457
Location: United States (IN)
Concentration: Strategy, Finance
Posts: 207
Kudos: 535
Kudos
Add Kudos
Bookmarks
Bookmark this Post
[quote="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

Bunuel bb - I want to bring to your notice that A (although not the correct answer) is 2mn – 1 and not 2mn, according to Manhattan. Thanks!
User avatar
bumpbot
User avatar
Non-Human User
Joined: 09 Sep 2013
Last visit: 04 Jan 2021
Posts: 37,373
Own Kudos:
Posts: 37,373
Kudos: 1,010
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.
Moderators:
Math Expert
102634 posts
PS Forum Moderator
686 posts