GMAT Question of the Day: Daily via email | Daily via Instagram New to GMAT Club? Watch this Video

It is currently 11 Jul 2020, 20:06

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

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

  new topic post reply Question banks Downloads My Bookmarks Reviews Important topics  
Author Message
TAGS:

Hide Tags

Find Similar Topics 
Math Expert
User avatar
V
Joined: 02 Sep 2009
Posts: 65187
For positive integers m and n, when n is divided by 7, the quotient is  [#permalink]

Show Tags

New post 21 Nov 2016, 01:43
1
8
00:00
A
B
C
D
E

Difficulty:

  85% (hard)

Question Stats:

54% (02:46) correct 46% (02:54) wrong based on 167 sessions

HideShow timer Statistics

Retired Moderator
User avatar
V
Status: Long way to go!
Joined: 10 Oct 2016
Posts: 1293
Location: Viet Nam
GMAT ToolKit User
Re: For positive integers m and n, when n is divided by 7, the quotient is  [#permalink]

Show Tags

New post 21 Nov 2016, 06:42
1
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.

The answer is A.
_________________
GMAT Club Legend
GMAT Club Legend
User avatar
V
Joined: 11 Sep 2015
Posts: 4959
Location: Canada
GMAT 1: 770 Q49 V46
Re: For positive integers m and n, when n is divided by 7, the quotient is  [#permalink]

Show Tags

New post 22 Nov 2016, 05: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

Answer:

RELATED VIDEO

_________________
Test confidently with gmatprepnow.com
Image
Senior SC Moderator
User avatar
V
Joined: 14 Nov 2016
Posts: 1339
Location: Malaysia
GMAT ToolKit User
Re: For positive integers m and n, when n is divided by 7, the quotient is  [#permalink]

Show Tags

New post 22 Feb 2017, 18: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
Untitled.jpg [ 190.27 KiB | Viewed 2972 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."

Rules for posting in verbal forum | Please DO NOT post short answer in your post!

Advanced Search : https://gmatclub.com/forum/advanced-search/
CrackVerbal Representative
User avatar
G
Affiliations: CrackVerbal
Joined: 03 Oct 2013
Posts: 1890
Location: India
GMAT 1: 780 Q51 V46
For positive integers m and n, when n is divided by 7, the quotient is  [#permalink]

Show Tags

New post 22 Apr 2020, 23:47
As per question data, m and n are positive integers. Also, when n is divided by 7, the quotient is m and the remainder is 2.

Dividend = Divisor * Quotient + Remainder.

Therefore, n = 7 * m + 2. Since m is a positive integer, m = 1 or 2 or 3 and so on.

From statement I alone, when n is divided by 11, the remainder is 2.
From the question data, when n is divided by 7, the remainder is 2.

Therefore, n = LCM (7, 11) k + 2, i.e. n = 77k + 2.

The possible values of n are 79, 156 and so on. Since n = 7m +2, the possible values of m are 11, 22 and so on.

For any of these values of m, the remainder will be ZERO when m is divided by 11.
Statement I alone is sufficient to answer the question. Answer options B, C and E can be eliminated. Possible answer options are A or D.

From statement II alone, when m is divided by 13, the remainder is 0. This means that m is a multiple of 13.
Therefore, m = 13 or 26 or 39…. and so on.
The possible remainders, when m is divided by 11 are 2, 4, 6 and so on.

Statement II alone is insufficient to find a unique value for the remainder. Answer option D can be eliminated.

The correct answer option is A.

Hope that helps!
_________________
GMAT Club Bot
For positive integers m and n, when n is divided by 7, the quotient is   [#permalink] 22 Apr 2020, 23:47

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

  new topic post reply Question banks Downloads My Bookmarks Reviews Important topics  





cron

Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne