It is currently 21 Oct 2017, 16:28

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

Events & Promotions

Events & Promotions in June
Open Detailed Calendar

The integers m and p are such that 2<m<p, and m is not a

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

Hide Tags

Intern
Intern
avatar
Joined: 09 Oct 2015
Posts: 49

Kudos [?]: 13 [0], given: 15

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

Show Tags

New post 04 Aug 2016, 18:21
Bunuel wrote:
Bumping for review and further discussion*. Get a kudos point for an alternative solution!

*New project from GMAT Club!!! Check HERE

Theory on remainders problems: remainders-144665.html

All DS remainders problems to practice: search.php?search_id=tag&tag_id=198
All PS remainders problems to practice: search.php?search_id=tag&tag_id=199


Hi Bunuel,

I am just going to take a stab at this question by trying to rephrase the question. I am not sure if i am thinking in the right direction. Kindly let me know!

The question mentions that m is not a factor of P. This could be rewritten as P = mQ + R . ( Q and R are positive integers) --> R is not equal to 0

Now the questions asks us to find whether r ( or R as per our previous statement) is greater than 1 or not. All we need to know is whether we can prove that r is equal to 1. If r is equal to 1 then P and m will not have any common factors. . We dont have to bother about the value of r otherwise

Looking at the statements:

(1) the greatest common factor of m and p is 2 - This means that P and m have common factors and thus r will be greater than 1 --> Sufficient
(2) the least common multiple of m and p is 30

Lets prove this by examples:
5 and 6 have no common factor but the LCM is 30 , R=1
15 & 10 have 5 as a common factor but the LCM is 30, R= 5

Hence insufficient

Answer is thus A

Regards,
Shradha

Kudos [?]: 13 [0], given: 15

GMAT Club Legend
GMAT Club Legend
User avatar
Joined: 09 Sep 2013
Posts: 16587

Kudos [?]: 273 [0], given: 0

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

Show Tags

New post 10 Aug 2017, 12:47
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 Books | GMAT Club Tests | Best Prices on GMAT Courses | GMAT Mobile App | Math Resources | Verbal Resources

Kudos [?]: 273 [0], given: 0

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

Go to page   Previous    1   2   [ 22 posts ] 

Display posts from previous: Sort by

The integers m and p are such that 2<m<p, and m is not a

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


GMAT Club MBA Forum Home| About| Terms and Conditions| GMAT Club Rules| Contact| Sitemap

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