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

It is currently 19 Jun 2019, 00: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

When positive integer m is divided by positive integer x, the reminder

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

Hide Tags

 
Math Expert
User avatar
V
Joined: 02 Sep 2009
Posts: 55681
When positive integer m is divided by positive integer x, the reminder  [#permalink]

Show Tags

New post 02 Jun 2015, 06:25
3
18
00:00
A
B
C
D
E

Difficulty:

  75% (hard)

Question Stats:

55% (01:40) correct 45% (01:58) wrong based on 164 sessions

HideShow timer Statistics

When positive integer m is divided by positive integer x, the reminder is 7 and when positive integer n is divided by positive integer y, the reminder is 11. Which of the following is a possible value for x + y?

I. 18
II. 19
III. 20

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

_________________
Manager
Manager
avatar
B
Joined: 12 Nov 2014
Posts: 62
When positive integer m is divided by positive integer x, the reminder  [#permalink]

Show Tags

New post 02 Jun 2015, 09:13
1
1
Euclid's Division Lemma states that "Given positive integers a and b, there exists unique integers q and r satisfying
a = bq+ r where 0 ≤ r < b" (q is quotient and r is remainder)

From the question :
m = x *q1 + 7 So from theorem 7< x ; x > 7
n = y *q2 + 11 So from theorem 11< y ; y > 11

So the least value of x = 8 & least value of y = 12
Least value of x+y = 20.

Out of given choices only III is possible.

Answer C
_________________
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Kindly press Kudos if the explanation is clear.
Thank you
Ambarish
Intern
Intern
avatar
Joined: 01 Jan 2015
Posts: 17
Re: When positive integer m is divided by positive integer x, the reminder  [#permalink]

Show Tags

New post 03 Jun 2015, 01:37
2
Bunuel wrote:
When positive integer m is divided by positive integer x, the reminder is 7 and when positive integer n is divided by positive integer y, the reminder is 11. Which of the following is a possible value for x + y?

I. 18
II. 19
III. 20

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


Since the reminders are 7 & 11 respectively, the minimum values for x & y are 8 and 12 respectively (y>11) (x>7)

Value of x+y = 12+8 =20. Hence C.
CEO
CEO
User avatar
D
Status: GMATINSIGHT Tutor
Joined: 08 Jul 2010
Posts: 2942
Location: India
GMAT: INSIGHT
Schools: Darden '21
WE: Education (Education)
Reviews Badge
Re: When positive integer m is divided by positive integer x, the reminder  [#permalink]

Show Tags

New post 03 Jun 2015, 06:35
1
3
Bunuel wrote:
When positive integer m is divided by positive integer x, the reminder is 7 and when positive integer n is divided by positive integer y, the reminder is 11. Which of the following is a possible value for x + y?

I. 18
II. 19
III. 20

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


TIP FOR SUCH QUESTIONS: Make Algebraic Equation in the beginning to understand how to proceed further. Then Start thinking the possible values of variables asked about

i.e. "When positive integer m is divided by positive integer x, the reminder is 7" can be understood as

m = ax +7 which means the value of x must be greater than 7 as the remainder 7 is possible only when the Divisor is bigger than the Remainder 7

i.e. Min Value of x = 8

AND

i.e. "When positive integer n is divided by positive integer y, the reminder is 11" can be understood as

n = by +11 which means the value of y must be greater than 11 as the remainder 11 is possible only when the Divisor is bigger than the Remainder 11

i.e. Min Value of y = 12

i.e. Minimum Value of x+y = 8+12 = 20

Hence III only can be True

Answer: Option
_________________
Prosper!!!
GMATinsight
Bhoopendra Singh and Dr.Sushma Jha
e-mail: info@GMATinsight.com I Call us : +91-9999687183 / 9891333772
Online One-on-One Skype based classes and Classroom Coaching in South and West Delhi
http://www.GMATinsight.com/testimonials.html

ACCESS FREE GMAT TESTS HERE:22 ONLINE FREE (FULL LENGTH) GMAT CAT (PRACTICE TESTS) LINK COLLECTION
Intern
Intern
avatar
Joined: 04 May 2014
Posts: 29
Re: When positive integer m is divided by positive integer x, the reminder  [#permalink]

Show Tags

New post 04 Jun 2015, 08:50
3
Maybe I'm going in too fast without thinking of the alternatives.
But when m/x yields remainder 7, you can assume x > 7
Similarly when n/y yields remainder 11, you can assume y > 11

Therefore the least possible would be x=8 and y=12.
Adding those together yields 20.
Only answer satisfying this would be C.

But like I said, maybe I overlooked things.
EMPOWERgmat Instructor
User avatar
V
Status: GMAT Assassin/Co-Founder
Affiliations: EMPOWERgmat
Joined: 19 Dec 2014
Posts: 14351
Location: United States (CA)
GMAT 1: 800 Q51 V49
GRE 1: Q170 V170
Re: When positive integer m is divided by positive integer x, the reminder  [#permalink]

Show Tags

New post 04 Jun 2015, 19:15
Hi tjerkrintjema,

You've handled this question perfectly. As you can see from the other posts, there are a variety of different ways to approach this prompt (most GMAT questions can be approached in more than one way). Beyond the immediate goal of trying to get a question correct, an additional goal should always be to take an approach that is fastest/easiest; you've done that here.

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

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

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/
Math Expert
User avatar
V
Joined: 02 Sep 2009
Posts: 55681
Re: When positive integer m is divided by positive integer x, the reminder  [#permalink]

Show Tags

New post 08 Jun 2015, 06:22
1
1
Bunuel wrote:
When positive integer m is divided by positive integer x, the reminder is 7 and when positive integer n is divided by positive integer y, the reminder is 11. Which of the following is a possible value for x + y?

I. 18
II. 19
III. 20

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


OFFICIAL SOLUTION:

The remainder is ALWAYS less than the divisor, thus x > 7 and y > 11. Therefore the least values of x and y are 8 and 12, respectively, making the least value of x + y equal to 20.

Answer: C.
_________________
Non-Human User
User avatar
Joined: 09 Sep 2013
Posts: 11396
Re: When positive integer m is divided by positive integer x, the reminder  [#permalink]

Show Tags

New post 27 Apr 2019, 03:17
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.
_________________
GMAT Club Bot
Re: When positive integer m is divided by positive integer x, the reminder   [#permalink] 27 Apr 2019, 03:17
Display posts from previous: Sort by

When positive integer m is divided by positive integer x, the reminder

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


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