GMAT Question of the Day - Daily to your Mailbox; hard ones only

 It is currently 23 Feb 2019, 01:46

### 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

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

## Events & Promotions

###### Events & Promotions in February
PrevNext
SuMoTuWeThFrSa
272829303112
3456789
10111213141516
17181920212223
242526272812
Open Detailed Calendar
• ### Free GMAT RC Webinar

February 23, 2019

February 23, 2019

07:00 AM PST

09:00 AM PST

Learn reading strategies that can help even non-voracious reader to master GMAT RC. Saturday, February 23rd at 7 AM PT
• ### FREE Quant Workshop by e-GMAT!

February 24, 2019

February 24, 2019

07:00 AM PST

09:00 AM PST

Get personalized insights on how to achieve your Target Quant Score.

# The sum of two positive integers, m and n, is a multiple of

Author Message
TAGS:

### Hide Tags

Intern
Joined: 08 May 2013
Posts: 11
The sum of two positive integers, m and n, is a multiple of  [#permalink]

### Show Tags

13 Jun 2013, 04:57
4
15
00:00

Difficulty:

95% (hard)

Question Stats:

44% (02:22) correct 57% (02:20) wrong based on 295 sessions

### HideShow timer Statistics

The sum of two positive integers, m and n, is a multiple of 3. Is n divisible by 3?

(1) When (m + 2n) is divided by 3 the remainder is 2.
(2) When (2m + n) is divided by 3 the remainder is 1.
Math Expert
Joined: 02 Sep 2009
Posts: 53066
Re: The sum of two positive integers, m and n, is a multiple of  [#permalink]

### Show Tags

13 Jun 2013, 05:07
8
2
The sum of two positive integers, m and n, is a multiple of 3. Is n divisible by 3?

Given: m + n = {multiple of 3}.

(1) When (m + 2n) is divided by 3 the remainder is 2:

m + 2n = {not a multiple of 3}
(m + n) + n = {not a multiple of 3}
{multiple of 3} + n = {not a multiple of 3}.

Thus n is not a multiple of 3. Sufficient.

(2) When (2m + n) is divided by 3 the remainder is 1:

2m + n = {not a multiple of 3}
(m + n) + m = {not a multiple of 3}
{multiple of 3} + m = {not a multiple of 3}.

Thus m is not a multiple of 3. Since m is NOT a multiple of 3 and m + n IS a multiple of 3, then n cannot be a multiple of 3. Sufficient.

Hope it's clear.
_________________
##### General Discussion
Senior Manager
Joined: 24 Aug 2009
Posts: 467
Schools: Harvard, Columbia, Stern, Booth, LSB,
Re: The sum of two positive integers, m and n, is a multiple of  [#permalink]

### Show Tags

13 Jun 2013, 05:09
2
The sum of two positive integers, m and n, is a multiple of 3. Is n divisible by 3?
(1) When (m + 2n) is divided by 3 the remainder is 2.
(2) When (2m + n) is divided by 3 the remainder is 1.

Nice question.
m+n = 3x (where x is a quotient & this equation means that the m+n is a multiple of 3) ------Eq1

Statement 1- m+2n = 3y + 2
(m+n) + n = 3y +2
3x +n = 3y +2
n-2 = 3(y-x)
It means that n-2 is some multiple of 3 i.e. n is not a multiple of 3
Sufficient

Statement 2- 2m+n = 3y + 1
(m+n) + m = 3y +1
3x +m = 3y +1
m-1 = 3(y-x)
It means that m-1 is some multiple of 3 i.e. m is not a multiple of 3.
If m+n is a multiple of 3 but m is not a multiple of 3, then n must also not be a multiple of 3
Sufficient

Hope this helps
_________________

If you like my Question/Explanation or the contribution, Kindly appreciate by pressing KUDOS.
Kudos always maximizes GMATCLUB worth
-Game Theory

If you have any question regarding my post, kindly pm me or else I won't be able to reply

Math Expert
Joined: 02 Sep 2009
Posts: 53066
Re: The sum of two positive integers, m and n, is a multiple of  [#permalink]

### Show Tags

13 Jun 2013, 05:12
4
Bunuel wrote:
The sum of two positive integers, m and n, is a multiple of 3. Is n divisible by 3?

Given: m + n = {multiple of 3}.

(1) When (m + 2n) is divided by 3 the remainder is 2:

m + 2n = {not a multiple of 3}
(m + n) + n = {not a multiple of 3}
{multiple of 3} + n = {not a multiple of 3}.

Thus n is not a multiple of 3. Sufficient.

(2) When (2m + n) is divided by 3 the remainder is 1:

2m + n = {not a multiple of 3}
(m + n) + m = {not a multiple of 3}
{multiple of 3} + m = {not a multiple of 3}.

Thus m is not a multiple of 3. Since m is NOT a multiple of 3 and m + n IS a multiple of 3, then n cannot be a multiple of 3. Sufficient.

Hope it's clear.

GENERALLY:
If integers $$a$$ and $$b$$ are both multiples of some integer $$k>1$$ (divisible by $$k$$), then their sum and difference will also be a multiple of $$k$$ (divisible by $$k$$):
Example: $$a=6$$ and $$b=9$$, both divisible by 3 ---> $$a+b=15$$ and $$a-b=-3$$, again both divisible by 3.

If out of integers $$a$$ and $$b$$ one is a multiple of some integer $$k>1$$ and another is not, then their sum and difference will NOT be a multiple of $$k$$ (divisible by $$k$$):
Example: $$a=6$$, divisible by 3 and $$b=5$$, not divisible by 3 ---> $$a+b=11$$ and $$a-b=1$$, neither is divisible by 3.

If integers $$a$$ and $$b$$ both are NOT multiples of some integer $$k>1$$ (divisible by $$k$$), then their sum and difference may or may not be a multiple of $$k$$ (divisible by $$k$$):
Example: $$a=5$$ and $$b=4$$, neither is divisible by 3 ---> $$a+b=9$$, is divisible by 3 and $$a-b=1$$, is not divisible by 3;
OR: $$a=6$$ and $$b=3$$, neither is divisible by 5 ---> $$a+b=9$$ and $$a-b=3$$, neither is divisible by 5;
OR: $$a=2$$ and $$b=2$$, neither is divisible by 4 ---> $$a+b=4$$ and $$a-b=0$$, both are divisible by 4.

Hope it helps.
_________________
Intern
Joined: 08 May 2013
Posts: 11
Re: The sum of two positive integers, m and n, is a multiple of  [#permalink]

### Show Tags

13 Jun 2013, 06:27
Bunuel wrote:
Bunuel wrote:
The sum of two positive integers, m and n, is a multiple of 3. Is n divisible by 3?

Given: m + n = {multiple of 3}.

(1) When (m + 2n) is divided by 3 the remainder is 2:

m + 2n = {not a multiple of 3}
(m + n) + n = {not a multiple of 3}
{multiple of 3} + n = {not a multiple of 3}.

Thus n is not a multiple of 3. Sufficient.

(2) When (2m + n) is divided by 3 the remainder is 1:

2m + n = {not a multiple of 3}
(m + n) + m = {not a multiple of 3}
{multiple of 3} + m = {not a multiple of 3}.

Thus m is not a multiple of 3. Since m is NOT a multiple of 3 and m + n IS a multiple of 3, then n cannot be a multiple of 3. Sufficient.

Hope it's clear.

GENERALLY:
If integers $$a$$ and $$b$$ are both multiples of some integer $$k>1$$ (divisible by $$k$$), then their sum and difference will also be a multiple of $$k$$ (divisible by $$k$$):
Example: $$a=6$$ and $$b=9$$, both divisible by 3 ---> $$a+b=15$$ and $$a-b=-3$$, again both divisible by 3.

If out of integers $$a$$ and $$b$$ one is a multiple of some integer $$k>1$$ and another is not, then their sum and difference will NOT be a multiple of $$k$$ (divisible by $$k$$):
Example: $$a=6$$, divisible by 3 and $$b=5$$, not divisible by 3 ---> $$a+b=11$$ and $$a-b=1$$, neither is divisible by 3.

If integers $$a$$ and $$b$$ both are NOT multiples of some integer $$k>1$$ (divisible by $$k$$), then their sum and difference may or may not be a multiple of $$k$$ (divisible by $$k$$):
Example: $$a=5$$ and $$b=4$$, neither is divisible by 3 ---> $$a+b=9$$, is divisible by 3 and $$a-b=1$$, is not divisible by 3;
OR: $$a=6$$ and $$b=3$$, neither is divisible by 5 ---> $$a+b=9$$ and $$a-b=3$$, neither is divisible by 5;
OR: $$a=2$$ and $$b=2$$, neither is divisible by 4 ---> $$a+b=4$$ and $$a-b=0$$, both are divisible by 4.

Hope it helps.

Sure, this really helps! The generic rules make it easier to understand.
Current Student
Joined: 23 May 2013
Posts: 186
Location: United States
Concentration: Technology, Healthcare
GMAT 1: 760 Q49 V45
GPA: 3.5
Re: The sum of two positive integers, m and n, is a multiple of  [#permalink]

### Show Tags

30 May 2014, 06:42
sps1604 wrote:
The sum of two positive integers, m and n, is a multiple of 3. Is n divisible by 3?

(1) When (m + 2n) is divided by 3 the remainder is 2.
(2) When (2m + n) is divided by 3 the remainder is 1.

ALTERNATE SOLUTION:

1) m+2n = 2, 5, 8, 11, 14....

Let's assume 3 divides n (let n = 3). Then m = -4, -1, 2, 5, 8, 11, 14...

m+n = -1, 2, 5, 8, 11, 14..., all of which are NOT divisible by 3. Thus we have reached a contradiction, and 1) is enough to tell us that n is NOT divisible by 3. SUFFICIENT.

2) 2m+n = 1, 4, 7, 10, 13, ....

Again, assume 3 divides n (let n = 3). Then 2m = -2, 1, 4, 7, 10, 13, .... Since m has to be an integer, m = -1, 2, 5, 8, 11, ...

m+n = 2, 5, 8, 11, 14, ... all of which are NOT divisible by 3. Thus, we have reached a contradiction and 2) is enough to tell us that n is NOT divisible by 3. SUFFICIENT.

EMPOWERgmat Instructor
Status: GMAT Assassin/Co-Founder
Affiliations: EMPOWERgmat
Joined: 19 Dec 2014
Posts: 13585
Location: United States (CA)
GMAT 1: 800 Q51 V49
GRE 1: Q170 V170
Re: The sum of two positive integers m and n is a multiple of 3....  [#permalink]

### Show Tags

03 Feb 2015, 20:18
1
Hi kdatt1991,

This DS question is actually built around a rare Number Property rule (know the rule will make solving this problem a lot easier); if you don't know the rule, then you can still answer the question by TESTing VALUES.

We're told that M and N are POSITIVE INTEGERS and that (M+N) is a multiple of 3.

That last 'restriction' is really important (and it's the Number Property rule) that I mentioned earlier:

Since both variables are POSITIVE INTEGERS, there are only 2 ways for (M+N) to be a multiple of 3:
1) If they're BOTH multiples of 3, then (M+N) will be a multiple of 3 (e.g. 3+3=6, 3+6=9, 12+15=27, etc.)
2) If one is NOT a multiple of 3, then the other MUST ALSO NOT be a multiple of 3 (e.g. 1+2=3, 5+4=9, 11+1=12, etc.)

The question asks if N is a multiple of 3. This is a YES/NO question.

Fact 1: (M+2N)/3 has a remainder of 2

IF....
M and N were both multiples of 3, then (M+2N)/3 would have a remainder of 0.

Since we're told that the remainder is 2, that means M and N are NOT multiples of 3, so the answer to the question is ALWAYS NO.
Fact 1 is SUFFICIENT

Fact 2: (2M+N)/3 has a remainder of 1

This is essentially the same issue we dealt with in Fact 1: IF...M and N were both multiples of 3, then (2M+N)/3 would have a remainder of 0. Since it has a remainder of 1, then M and N are NOT multiples of 3 and the answer to the question is ALWAYS NO.
Fact 2 is SUFFICIENT

GMAT assassins aren't born, they're made,
Rich
_________________

760+: Learn What GMAT Assassins Do to Score at the Highest Levels
Contact Rich at: Rich.C@empowergmat.com

# Rich Cohen

Co-Founder & GMAT Assassin

Special Offer: Save \$75 + GMAT Club Tests Free
Official GMAT Exam Packs + 70 Pt. Improvement Guarantee
www.empowergmat.com/

*****Select EMPOWERgmat Courses now include ALL 6 Official GMAC CATs!*****

Non-Human User
Joined: 09 Sep 2013
Posts: 9891
Re: The sum of two positive integers, m and n, is a multiple of  [#permalink]

### Show Tags

29 Nov 2017, 09:36
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.
_________________
Re: The sum of two positive integers, m and n, is a multiple of   [#permalink] 29 Nov 2017, 09:36
Display posts from previous: Sort by