(Go: >> BACK << -|- >> HOME <<)

Last visit was: 18 Jun 2024, 09:25 It is currently 18 Jun 2024, 09:25
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
SORT BY:
Date
Tags:
Show Tags
Hide Tags
Math Expert
Joined: 02 Sep 2009
Posts: 93734
Own Kudos [?]: 632767 [4]
Given Kudos: 82345
Send PM
Intern
Intern
Joined: 02 Feb 2021
Posts: 37
Own Kudos [?]: 27 [0]
Given Kudos: 21
Send PM
Dream Score Representative
Joined: 07 Oct 2021
Posts: 385
Own Kudos [?]: 310 [2]
Given Kudos: 2
Send PM
Math Expert
Joined: 02 Sep 2009
Posts: 93734
Own Kudos [?]: 632767 [0]
Given Kudos: 82345
Send PM
Re: If m and n are positive integers, and the remainder when m is divided [#permalink]
Expert Reply
If \(m\) and \(n\) are positive integers, and the remainder when \(m\) is divided by \(n\) is equal to the remainder when \(n\) is divided by \(m\), then which of the following could be the value of \(m*n\)?

I. 12

II. 24

III. 36


A. I only
B. II only
C. III only
D. I and III only
E. II and II only


We are given that the remainder when \(m\) is divided by \(n\) is equal to the remainder when \(n\) is divided by \(m\). This implies that \(m\) must be equal to \(n\), and consequently, \(mn\) must be the square of an integer. Therefore, the answer is C, III only.

To further elaborate on why \(m\) must be equal to \(n\), assume \(m < n\). In this case, the remainder when \(m\) is divided by \(n\) would be \(m\) itself. However, since we are given that the remainder when \(m\) is divided by \(n\) is equal to the remainder when \(n\) is divided by \(m\), it would mean the remainder when \(n\) is divided by \(m\) should also be \(m\). This scenario is impossible because the divisor must always be greater than the remainder. A similar contradiction arises if we assume \(n < m\). Therefore, the only consistent possibility is that \(m\) equals \(n\).


Answer: C
CEO
CEO
Joined: 07 Mar 2019
Posts: 2597
Own Kudos [?]: 1852 [0]
Given Kudos: 763
Location: India
WE:Sales (Energy and Utilities)
Send PM
Re: If m and n are positive integers, and the remainder when m is divided [#permalink]
If m and n are positive integers, and the remainder when m is divided by n is equal to the remainder when n divided by m, then which of the following could be the value of m*n?

I. 12
II. 24
III. 36

A. I only
B. II only
C. III only
D. I and III only
E. II and II only

Let's try each
m*n = 12
As each of m and n are positive integers, both can hold values that are factors of 12 i.e. 1,2,3,4,6,12.
Since remainder of extreme values when divided by each other would not be equal, the middle value that re closest to each other would most satisfy the condition.
In this case 3 and 4 are possibilities but remainder is not equal. Hence this is not the option.

A and D are out.

m*n = 24
1,2,3,4,6,8,12,24
Here 4 and 6 are possibilities but just like above example this is not satisfying the condition.

POE helps us hence answer is C.

Let's check anyway
m*n = 36
1,2,3,4,6,9,12,18,36
Hence m and n are equal i.e. 6

Answer C.
Re: If m and n are positive integers, and the remainder when m is divided [#permalink]
Moderator:
Math Expert
93734 posts