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.

It appears that you are browsing the GMAT Club forum unregistered!

Signing up is free, quick, and confidential.
Join other 500,000 members and get the full benefits of GMAT Club

Registration gives you:

Tests

Take 11 tests and quizzes from GMAT Club and leading GMAT prep companies such as Manhattan GMAT,
Knewton, and others. All are free for GMAT Club members.

Applicant Stats

View detailed applicant stats such as GPA, GMAT score, work experience, location, application
status, and more

Books/Downloads

Download thousands of study notes,
question collections, GMAT Club’s
Grammar and Math books.
All are free!

Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:

St. 1 : GCF is 2 - Insufficient --> m,p values could be 6,10 or 8,12 or 4,10 St. 2 : LCM is 30 - Insufficient --> m,p values could be 3,10 or 5,6 or 6,10

St. 1 & 2 : Sufficient --> only value is 6,10 --> we can get the value of r.

Hence, answer is C !

What's the OA ?
_________________

"Success is going from failure to failure without a loss of enthusiam." - Winston Churchill

As vs Like - Check this link : http://www.grammar-quizzes.com/like-as.html.

The integers m and p are such that 2<m<p, and m is not a factor of p. if r is the remainder when p is divided by m, is r>1?

Given: \(2<m<p\) and \(\frac{p}{m}\neq{integer}\). \(p=xm+r\). q: \(r=?\)

(1) The greatest common factor of m and p is 2 --> \(p\) and \(m\) are even (as both have 2 as a factor) --> even divided by even can give only even remainder (0, 2, 4, ...), since the remainder is not zero (as \(\frac{p}{m}\neq{integer}\)), then the remainder must be more than 1. Sufficient.

(2) The least common multiple of m and p is 30 --> if \(m=5\) and \(p=6\), then remainder=1=1 and thus the answer to the question will be NO. BUT if \(m=10\) and \(p=15\), then remainder=5>1 and thus the answer to the question will be YES. Two different answers. Not sufficient.

The integers m and p are such that 2<m<p, and m is not a factor of p. if r is the remainder when p is divided by m, is r>1?

Given: \(2<m<p\) and \(\frac{p}{m}\neq{integer}\). \(p=xm+r\). q: \(r=?\)

(1) the greatest common factor of m and p is 2 --> p and m are even (as both have 2 as a factor) --> even divided by even can give only even remainder (0, 2, 4, ...), since remainder is not zero (as \(\frac{p}{m}\neq{integer}\)), then remainder must be more than 1. Sufficient.

(2) the least common multiple of m and p is 30 --> if m=5 and p=6, remainder=1=1, answer to the question would be NO. BUT if m=10 and p=15 remainder=5>1 answer to the question would be YES. Two different answers. Not sufficient.

Answer: A.

Perfect explanation! But slightly tough question to be approached within 2 minutes.

The integers m and p are such that 2<m<p, and m is not a factor of p. if r is the remainder when p is divided by m, is r>1?

Given: \(2<m<p\) and \(\frac{p}{m}\neq{integer}\). \(p=xm+r\). q: \(r=?\)

(1) The greatest common factor of m and p is 2 --> \(p\) and \(m\) are even (as both have 2 as a factor) --> even divided by even can give only even remainder (0, 2, 4, ...), since the remainder is not zero (as \(\frac{p}{m}\neq{integer}\)), then the remainder must be more than 1. Sufficient.

(2) The least common multiple of m and p is 30 --> if \(m=5\) and \(p=6\), then remainder=1=1 and thus the answer to the question will be NO. BUT if \(m=10\) and \(p=15\), then remainder=5>1 and thus the answer to the question will be YES. Two different answers. Not sufficient.

Answer: A.

Bunuel, one question: Why is the answer A? If p is 12 and m is 10, then the GCF is 2 and the reminder would be 1. What am I missing? Many thanks!

The integers m and p are such that 2<m<p, and m is not a factor of p. if r is the remainder when p is divided by m, is r>1?

Given: \(2<m<p\) and \(\frac{p}{m}\neq{integer}\). \(p=xm+r\). q: \(r=?\)

(1) The greatest common factor of m and p is 2 --> \(p\) and \(m\) are even (as both have 2 as a factor) --> even divided by even can give only even remainder (0, 2, 4, ...), since the remainder is not zero (as \(\frac{p}{m}\neq{integer}\)), then the remainder must be more than 1. Sufficient.

(2) The least common multiple of m and p is 30 --> if \(m=5\) and \(p=6\), then remainder=1=1 and thus the answer to the question will be NO. BUT if \(m=10\) and \(p=15\), then remainder=5>1 and thus the answer to the question will be YES. Two different answers. Not sufficient.

Answer: A.

Bunuel, one question: Why is the answer A? If p is 12 and m is 10, then the GCF is 2 and the reminder would be 1. What am I missing? Many thanks!

12 divided by 10 gives the remainder of 2, not 1: 12=1*10+2.

The integers m and p are such that 2<m<p, and m is not a factor of p. if r is the remainder when p is divided by m, is r>1?

Given: \(2<m<p\) and \(\frac{p}{m}\neq{integer}\). \(p=xm+r\). q: \(r=?\)

(1) The greatest common factor of m and p is 2 --> \(p\) and \(m\) are even (as both have 2 as a factor) --> even divided by even can give only even remainder (0, 2, 4, ...), since the remainder is not zero (as \(\frac{p}{m}\neq{integer}\)), then the remainder must be more than 1. Sufficient.

(2) The least common multiple of m and p is 30 --> if \(m=5\) and \(p=6\), then remainder=1=1 and thus the answer to the question will be NO. BUT if \(m=10\) and \(p=15\), then remainder=5>1 and thus the answer to the question will be YES. Two different answers. Not sufficient.

Answer: A.

I just have one doubt which seems going against my basic concepts when 15 is divided by 10, it has same result as when 3 is divided by 2, and when you divide 15 by 10, you do not take it as 3 divided by 2. The remainders of both the fractions should 1, but you are taking it otherwise.

The integers m and p are such that 2<m<p, and m is not a factor of p. if r is the remainder when p is divided by m, is r>1?

Given: \(2<m<p\) and \(\frac{p}{m}\neq{integer}\). \(p=xm+r\). q: \(r=?\)

(1) The greatest common factor of m and p is 2 --> \(p\) and \(m\) are even (as both have 2 as a factor) --> even divided by even can give only even remainder (0, 2, 4, ...), since the remainder is not zero (as \(\frac{p}{m}\neq{integer}\)), then the remainder must be more than 1. Sufficient.

(2) The least common multiple of m and p is 30 --> if \(m=5\) and \(p=6\), then remainder=1=1 and thus the answer to the question will be NO. BUT if \(m=10\) and \(p=15\), then remainder=5>1 and thus the answer to the question will be YES. Two different answers. Not sufficient.

Answer: A.

I just have one doubt which seems going against my basic concepts when 15 is divided by 10, it has same result as when 3 is divided by 2, and when you divide 15 by 10, you do not take it as 3 divided by 2. The remainders of both the fractions should 1, but you are taking it otherwise.

Pl explain this part.

Not sure I understand what you mean. Can you please elaborate? Thank you.

Both 15/10 and 3/2 is 1.5 but the remainder when 15 is divided by 10 is 5 and the remainders when 3 is divided by 2 is 1.
_________________

The integers m and p are such that 2<m<p, and m is not a factor of p. if r is the remainder when p is divided by m, is r>1?

Given: \(2<m<p\) and \(\frac{p}{m}\neq{integer}\). \(p=xm+r\). q: \(r=?\)

(1) The greatest common factor of m and p is 2 --> \(p\) and \(m\) are even (as both have 2 as a factor) --> even divided by even can give only even remainder (0, 2, 4, ...), since the remainder is not zero (as \(\frac{p}{m}\neq{integer}\)), then the remainder must be more than 1. Sufficient.

(2) The least common multiple of m and p is 30 --> if \(m=5\) and \(p=6\), then remainder=1=1 and thus the answer to the question will be NO. BUT if \(m=10\) and \(p=15\), then remainder=5>1 and thus the answer to the question will be YES. Two different answers. Not sufficient.

Answer: A.

I just have one doubt which seems going against my basic concepts when 15 is divided by 10, it has same result as when 3 is divided by 2, and when you divide 15 by 10, you do not take it as 3 divided by 2. The remainders of both the fractions should 1, but you are taking it otherwise.

Pl explain this part.

Not sure I understand what you mean. Can you please elaborate? Thank you.

Both 15/10 and 3/2 is 1.5 but the remainder when 15 is divided by 10 is 5 and the remainders when 3 is divided by 2 is 1.

Why is the remainder of 15/10 is 5 and not 1? we know that 15/10 is same as 3/2. What I am doing while calculating remainders, I simplify the fraction if it can be further simplified like in the case of 15/10, I simplified the fraction to 3/2 and then I will find the remainder, it comes out to be 1 but If I donot simplify the fraction the remainder comes out to be 5.

Why is the remainder of 15/10 is 5 and not 1? we know that 15/10 is same as 3/2. What I am doing while calculating remainders, I simplify the fraction if it can be further simplified like in the case of 15/10, I simplified the fraction to 3/2 and then I will find the remainder, it comes out to be 1 but If I donot simplify the fraction the remainder comes out to be 5.

Hmm. Well what you are doing is not entirely correct. When you simplify the given fractions, keep in hand the common factor which factored out from both the Numerator and the Denominator. For eg, in \(\frac{15}{10}\) we factored out 5 from both the places. Thus, the remainder of the simplified fraction, as you correctly said is 1. Just multiply this back with the common factor, i.e. in this case 5. And hence, the final remainder is 5.

You cannot just cancel out factors and expect the same remainder.

For eg, if your logic were true, we would have Remainder of \(\frac{16}{6}\) = Remainder of \(\frac{8}{3}\) which is definitely not the case.
_________________

Re: The integers m and p are such that 2<m<p, and m is not a [#permalink]

Show Tags

19 Nov 2014, 10:43

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 integers m and p are such that 2<m<p, and m is not a [#permalink]

Show Tags

14 Jul 2016, 00:54

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.
_________________

Happy New Year everyone! Before I get started on this post, and well, restarted on this blog in general, I wanted to mention something. For the past several months...

It’s quickly approaching two years since I last wrote anything on this blog. A lot has happened since then. When I last posted, I had just gotten back from...

Post-MBA I became very intrigued by how senior leaders navigated their career progression. It was also at this time that I realized I learned nothing about this during my...