Last visit was: 12 May 2026, 19:37 It is currently 12 May 2026, 19:37
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: 12 May 2026
Posts: 110,299
Own Kudos:
814,563
 [3]
Given Kudos: 106,204
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 110,299
Kudos: 814,563
 [3]
Kudos
Add Kudos
3
Bookmarks
Bookmark this Post
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 12 May 2026
Posts: 110,299
Own Kudos:
814,563
 [1]
Given Kudos: 106,204
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 110,299
Kudos: 814,563
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
Josvit
Joined: 19 Apr 2023
Last visit: 22 Aug 2024
Posts: 18
Own Kudos:
Given Kudos: 9
Posts: 18
Kudos: 17
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
phmahi1997
Joined: 09 Oct 2019
Last visit: 14 Nov 2025
Posts: 107
Own Kudos:
Given Kudos: 42
Location: Bangladesh
Concentration: Technology, General Management
GMAT Focus 1: 515 Q79 V75 DI73
GPA: 2.61
GMAT Focus 1: 515 Q79 V75 DI73
Posts: 107
Kudos: 23
Kudos
Add Kudos
Bookmarks
Bookmark this Post
I like the solution - it’s helpful. Ureal!!!!
User avatar
saibharatmba
Joined: 23 May 2022
Last visit: 30 Apr 2026
Posts: 9
Own Kudos:
Given Kudos: 14
Location: India
Concentration: Strategy, Technology
GPA: 8.6
WE:Programming (Manufacturing)
Posts: 9
Kudos: 10
Kudos
Add Kudos
Bookmarks
Bookmark this Post
How about (4,6)
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 12 May 2026
Posts: 110,299
Own Kudos:
814,563
 [2]
Given Kudos: 106,204
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 110,299
Kudos: 814,563
 [2]
1
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
saibharatmba

Bunuel
Official Solution:

If \(m\) and \(n\) are integers, how many pairs of \((m, n)\) are there such that \(3m + 2n = mn\)?

A. 4
B. 5
C. 6
D. 8
E. 10


Arguably the best way to solve this question is to manipulate \(3m + 2n = mn\) such that we can factor it into \((m + a)(n + b) = integer\). Then, benefiting from the fact that \(m\) and \(n\) are integers, we'd be able to find the sets of \((m, n)\) satisfying the equation.

\(3m + 2n = mn\);

\(3m - mn + 2n = 0[\);

\(m(3 - n) + 2n = 0\).

To further factor \((3 - n)\), add -6 to both sides:

\(m(3 - n) - 6 + 2n= -6\);

\(m(3 - n) - 2(3 - n) = -6\);

\((3 - n)(m - 2) = -6\).

Now, the question essentially boils down to finding how many ways -6 can be written as the product of two integers, \((3 - n)\) and \((m - 2)\):

\(-6*1\)

\(-3*2\)

-\(2*3\)

\(-1*6\)

\(1*(-6)\)

\(2*(-3)\)

\(3*(-2)\)

\(6*(-1)\)

Therefore, there are eight sets of integers \((m, n)\) satisfying \((3 - n)(m - 2) = -6\). To find the exact values, though unnecessary, we equate \((3 - n)\) and \((m - 2)\) to each pair of factors above.


Answer: D

How about (4,6)

This is counted when m - 2 = 2 and 3 - n = -3
User avatar
Bshubham512
Joined: 30 Nov 2021
Last visit: 17 Apr 2026
Posts: 17
Own Kudos:
Given Kudos: 131
Location: India
Schools: ISB '27
Schools: ISB '27
Posts: 17
Kudos: 2
Kudos
Add Kudos
Bookmarks
Bookmark this Post
how about (5,5)
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 12 May 2026
Posts: 110,299
Own Kudos:
Given Kudos: 106,204
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 110,299
Kudos: 814,563
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Bshubham512

Bunuel
Official Solution:

If \(m\) and \(n\) are integers, how many pairs of \((m, n)\) are there such that \(3m + 2n = mn\)?

A. 4
B. 5
C. 6
D. 8
E. 10


Arguably the best way to solve this question is to manipulate \(3m + 2n = mn\) such that we can factor it into \((m + a)(n + b) = integer\). Then, benefiting from the fact that \(m\) and \(n\) are integers, we'd be able to find the sets of \((m, n)\) satisfying the equation.

\(3m + 2n = mn\);

\(3m - mn + 2n = 0[\);

\(m(3 - n) + 2n = 0\).

To further factor \((3 - n)\), add -6 to both sides:

\(m(3 - n) - 6 + 2n= -6\);

\(m(3 - n) - 2(3 - n) = -6\);

\((3 - n)(m - 2) = -6\).

Now, the question essentially boils down to finding how many ways -6 can be written as the product of two integers, \((3 - n)\) and \((m - 2)\):

\(-6*1\)

\(-3*2\)

\(-2*3\)

\(-1*6\)

\(1*(-6)\)

\(2*(-3)\)

\(3*(-2)\)

\(6*(-1)\)

Therefore, there are eight sets of integers \((m, n)\) satisfying \((3 - n)(m - 2) = -6\). To find the exact values, though unnecessary, we equate \((3 - n)\) and \((m - 2)\) to each pair of factors above.


Answer: D
how about (5,5)

This is counted when m - 2 = 3 and 3 - n = -2.
User avatar
juliansorre
Joined: 11 Mar 2024
Last visit: 12 May 2026
Posts: 19
Own Kudos:
Posts: 19
Kudos: 3
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Hi Bunuel,
How can one be sure that the 8 sets of integers (m,n) that satisfy (3-n)*(m-2) = -6 will not produce any repeated pairs of (m,n)?

Bunuel
Quote:
Official Solution:

If \(m\) and \(n\) are integers, how many pairs of \((m, n)\) are there such that \(3m + 2n = mn\)?
A. 4
B. 5
C. 6
D. 8
E. 10


Arguably the best way to solve this question is to manipulate \(3m + 2n = mn\) such that we can factor it into \((m + a)(n + b) = integer\). Then, benefiting from the fact that \(m\) and \(n\) are integers, we'd be able to find the sets of \((m, n)\) satisfying the equation.

\(3m + 2n = mn\);

\(3m - mn + 2n = 0[\);

\(m(3 - n) + 2n = 0\).

To further factor \((3 - n)\), add -6 to both sides:

\(m(3 - n) - 6 + 2n= -6\);

\(m(3 - n) - 2(3 - n) = -6\);

\((3 - n)(m - 2) = -6\).

Now, the question essentially boils down to finding how many ways -6 can be written as the product of two integers, \((3 - n)\) and \((m - 2)\):

\(-6*1\)

\(-3*2\)

\(-2*3\)

\(-1*6\)

\(1*(-6)\)

\(2*(-3)\)

\(3*(-2)\)

\(6*(-1)\)

Therefore, there are eight sets of integers \((m, n)\) satisfying \((3 - n)(m - 2) = -6\). To find the exact values, though unnecessary, we equate \((3 - n)\) and \((m - 2)\) to each pair of factors above.


Answer: D
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 12 May 2026
Posts: 110,299
Own Kudos:
Given Kudos: 106,204
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 110,299
Kudos: 814,563
Kudos
Add Kudos
Bookmarks
Bookmark this Post
juliansorre
Hi Bunuel,
How can one be sure that the 8 sets of integers (m,n) that satisfy (3-n)*(m-2) = -6 will not produce any repeated pairs of (m,n)?

Bunuel
Quote:
Official Solution:

If \(m\) and \(n\) are integers, how many pairs of \((m, n)\) are there such that \(3m + 2n = mn\)?
A. 4
B. 5
C. 6
D. 8
E. 10


Arguably the best way to solve this question is to manipulate \(3m + 2n = mn\) such that we can factor it into \((m + a)(n + b) = integer\). Then, benefiting from the fact that \(m\) and \(n\) are integers, we'd be able to find the sets of \((m, n)\) satisfying the equation.

\(3m + 2n = mn\);

\(3m - mn + 2n = 0[\);

\(m(3 - n) + 2n = 0\).

To further factor \((3 - n)\), add -6 to both sides:

\(m(3 - n) - 6 + 2n= -6\);

\(m(3 - n) - 2(3 - n) = -6\);

\((3 - n)(m - 2) = -6\).

Now, the question essentially boils down to finding how many ways -6 can be written as the product of two integers, \((3 - n)\) and \((m - 2)\):

\(-6*1\)

\(-3*2\)

\(-2*3\)

\(-1*6\)

\(1*(-6)\)

\(2*(-3)\)

\(3*(-2)\)

\(6*(-1)\)

Therefore, there are eight sets of integers \((m, n)\) satisfying \((3 - n)(m - 2) = -6\). To find the exact values, though unnecessary, we equate \((3 - n)\) and \((m - 2)\) to each pair of factors above.


Answer: D

Duplicates cannot occur because (3 - n) and (m - 2) are equated to different values in each case. Since each equation directly determines a unique value for n and m, no two cases can produce the same (m, n) pair.
User avatar
Shivang29
Joined: 16 Sep 2024
Last visit: 05 Nov 2025
Posts: 23
Own Kudos:
Given Kudos: 30
Posts: 23
Kudos: 13
Kudos
Add Kudos
Bookmarks
Bookmark this Post
what about (0,0)?
Bunuel
Official Solution:

If \(m\) and \(n\) are integers, how many pairs of \((m, n)\) are there such that \(3m + 2n = mn\)?

A. 4
B. 5
C. 6
D. 8
E. 10


Arguably the best way to solve this question is to manipulate \(3m + 2n = mn\) such that we can factor it into \((m + a)(n + b) = integer\). Then, benefiting from the fact that \(m\) and \(n\) are integers, we'd be able to find the sets of \((m, n)\) satisfying the equation.

\(3m + 2n = mn\);

\(3m - mn + 2n = 0[\);

\(m(3 - n) + 2n = 0\).

To further factor \((3 - n)\), add -6 to both sides:

\(m(3 - n) - 6 + 2n= -6\);

\(m(3 - n) - 2(3 - n) = -6\);

\((3 - n)(m - 2) = -6\).

Now, the question essentially boils down to finding how many ways -6 can be written as the product of two integers, \((3 - n)\) and \((m - 2)\):

\(-6*1\)

\(-3*2\)

\(-2*3\)

\(-1*6\)

\(1*(-6)\)

\(2*(-3)\)

\(3*(-2)\)

\(6*(-1)\)

Therefore, there are eight sets of integers \((m, n)\) satisfying \((3 - n)(m - 2) = -6\). To find the exact values, though unnecessary, we equate \((3 - n)\) and \((m - 2)\) to each pair of factors above.


Answer: D
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 12 May 2026
Posts: 110,299
Own Kudos:
Given Kudos: 106,204
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 110,299
Kudos: 814,563
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Shivang29
what about (0,0)?
Bunuel
Official Solution:

If \(m\) and \(n\) are integers, how many pairs of \((m, n)\) are there such that \(3m + 2n = mn\)?

A. 4
B. 5
C. 6
D. 8
E. 10


Arguably the best way to solve this question is to manipulate \(3m + 2n = mn\) such that we can factor it into \((m + a)(n + b) = integer\). Then, benefiting from the fact that \(m\) and \(n\) are integers, we'd be able to find the sets of \((m, n)\) satisfying the equation.

\(3m + 2n = mn\);

\(3m - mn + 2n = 0[\);

\(m(3 - n) + 2n = 0\).

To further factor \((3 - n)\), add -6 to both sides:

\(m(3 - n) - 6 + 2n= -6\);

\(m(3 - n) - 2(3 - n) = -6\);

\((3 - n)(m - 2) = -6\).

Now, the question essentially boils down to finding how many ways -6 can be written as the product of two integers, \((3 - n)\) and \((m - 2)\):

\(-6*1\)

\(-3*2\)

\(-2*3\)

\(-1*6\)

\(1*(-6)\)

\(2*(-3)\)

\(3*(-2)\)

\(6*(-1)\)

Therefore, there are eight sets of integers \((m, n)\) satisfying \((3 - n)(m - 2) = -6\). To find the exact values, though unnecessary, we equate \((3 - n)\) and \((m - 2)\) to each pair of factors above.


Answer: D

This is counted when m - 2 = 2 and 3 - n = -3.
Moderators:
Math Expert
110299 posts
Founder
43270 posts