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

 It is currently 23 Sep 2018, 13:11

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

# For positive integers m and n, when n is divided by 7, the quotient is

Author Message
TAGS:

### Hide Tags

Math Expert
Joined: 02 Sep 2009
Posts: 49320
For positive integers m and n, when n is divided by 7, the quotient is  [#permalink]

### Show Tags

21 Nov 2016, 02:43
00:00

Difficulty:

85% (hard)

Question Stats:

49% (02:47) correct 51% (02:39) wrong based on 78 sessions

### HideShow timer Statistics

For positive integers m and n, when n is divided by 7, the quotient is m and the remainder is 2. What is the remainder when m is divided by 11?

(1) When n is divided by 11, the remainder is 2.
(2) When m is divided by 13, the remainder is 0.

_________________
Senior CR Moderator
Status: Long way to go!
Joined: 10 Oct 2016
Posts: 1386
Location: Viet Nam
Re: For positive integers m and n, when n is divided by 7, the quotient is  [#permalink]

### Show Tags

21 Nov 2016, 07:42
Bunuel wrote:
For positive integers m and n, when n is divided by 7, the quotient is m and the remainder is 2. What is the remainder when m is divided by 11?

(1) When n is divided by 11, the remainder is 2.
(2) When m is divided by 13, the remainder is 0.

$$n=7m+2$$

(1) $$n=11k+2 \implies 7m+2=11k+2 \implies 7m=11k$$. We have $$(7,11)=1$$, so $$m$$ is divisible by 11. The remainder is 0. Sufficient.

(2) $$m=13k$$ so $$m$$ could be 13, 26, 39,... and the remainder when m is divided by 11 could be 2, 4, 6, ... Insufficient.

_________________
CEO
Joined: 12 Sep 2015
Posts: 2884
Re: For positive integers m and n, when n is divided by 7, the quotient is  [#permalink]

### Show Tags

22 Nov 2016, 06:59
Top Contributor
Bunuel wrote:
For positive integers m and n, when n is divided by 7, the quotient is m and the remainder is 2. What is the remainder when m is divided by 11?

(1) When n is divided by 11, the remainder is 2.
(2) When m is divided by 13, the remainder is 0.

Target question: What is the remainder when m is divided by 11?

Given: When n is divided by 7, the quotient is m and the remainder is 2
There's a nice rule that say, "If N divided by D equals Q with remainder R, then N = DQ + R"
For example, since 17 divided by 5 equals 3 with remainder 2, then we can write 17 = (5)(3) + 2
Likewise, since 53 divided by 10 equals 5 with remainder 3, then we can write 53 = (10)(5) + 3

So, with the given information, we can write: n = 7m + 2

Statement 1: When n is divided by 11, the remainder is 2.
In other words, n divided by 11 equals some unstated integer (say k) with remainder 2.
Applying the above rule, we can write: n = 11k + 2 (where k is some integer)
Since we already know that n = 7m + 2, we write the following equation:
7m + 2 = 11k + 2
Subtract 2 from both sides to get: 7m = 11k
Divide both sides by 7 to get: m = 11k/7
Or we can say m = (11)(k/7)
What does this tell us?
First, it tells us that, since m is an integer, it MUST be true that k is divisible by 7.
It also tells us that m is divisible by 11
If m is divisible by 11, then when m is divided by 11, the remainder will be 0
Since we can answer the target question with certainty, statement 1 is SUFFICIENT

Statement 2: When m is divided by 13, the remainder is 0
Applying the above rule, we can write: m = 13j (where j is some integer)
We already know that n = 7m + 2, but that doesn't help us much this time.
We COULD take n = 7m + 2 and replace m with 13j to get n = 7(13j) + 2. However, this doesn't get us very far, since the target question is all about what happens when we divide m by 11, and our new equation doesn't even include m.
At this point, I suggest that we start TESTING VALUES.
There are several values of m that satisfy statement 2. Here are two:
Case a: m = 13, in which case m divided by 11 gives us a remainder of 2
Case b: m = 26, in which case m divided by 11 gives us a remainder of 4
Since we cannot answer the target question with certainty, statement 2 is NOT SUFFICIENT

RELATED VIDEO

_________________

Brent Hanneson – GMATPrepNow.com

Senior SC Moderator
Joined: 14 Nov 2016
Posts: 1322
Location: Malaysia
Re: For positive integers m and n, when n is divided by 7, the quotient is  [#permalink]

### Show Tags

22 Feb 2017, 19:35
Bunuel wrote:
For positive integers m and n, when n is divided by 7, the quotient is m and the remainder is 2. What is the remainder when m is divided by 11?

(1) When n is divided by 11, the remainder is 2.
(2) When m is divided by 13, the remainder is 0.

Official solution from Veritas Prep.
Attachments

Untitled.jpg [ 190.27 KiB | Viewed 1110 times ]

_________________

"Be challenged at EVERY MOMENT."

“Strength doesn’t come from what you can do. It comes from overcoming the things you once thought you couldn’t.”

"Each stage of the journey is crucial to attaining new heights of knowledge."

Re: For positive integers m and n, when n is divided by 7, the quotient is &nbs [#permalink] 22 Feb 2017, 19:35
Display posts from previous: Sort by

# For positive integers m and n, when n is divided by 7, the quotient is

## Events & Promotions

 Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne Kindly note that the GMAT® test is a registered trademark of the Graduate Management Admission Council®, and this site has neither been reviewed nor endorsed by GMAC®.