Last visit was: 19 Nov 2025, 06:47 It is currently 19 Nov 2025, 06:47
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
User avatar
haas_mba07
Joined: 02 Jun 2006
Last visit: 26 Jun 2008
Posts: 662
Own Kudos:
Posts: 662
Kudos: 216
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
heman
Joined: 20 Mar 2006
Last visit: 12 Dec 2006
Posts: 104
Own Kudos:
Posts: 104
Kudos: 10
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
Professor
Joined: 29 Dec 2005
Last visit: 09 Aug 2011
Posts: 562
Own Kudos:
Posts: 562
Kudos: 184
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
heman
Joined: 20 Mar 2006
Last visit: 12 Dec 2006
Posts: 104
Own Kudos:
Posts: 104
Kudos: 10
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Professor
only A.

what about if the integers are 5 and 6?

For that r=1

Do you have a case for (2) when r!= 1 ?

Heman
User avatar
haas_mba07
Joined: 02 Jun 2006
Last visit: 26 Jun 2008
Posts: 662
Own Kudos:
Posts: 662
Kudos: 216
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Professor,
Can you please provide some more insight into problems like these? I get hopelessly lost at such problems.


Professor
only A.

what about if the integers are 5 and 6?
User avatar
yezz
User avatar
Retired Moderator
Joined: 05 Jul 2006
Last visit: 26 Apr 2022
Posts: 833
Own Kudos:
Given Kudos: 49
Posts: 833
Kudos: 1,661
Kudos
Add Kudos
Bookmarks
Bookmark this Post
I think the question want us to prove they are not consecutive

any two cnsecutives are relatively prime to each other

ie : GCF = 1

FROM ONE

GCF =2 THUS THEY ARE NOT CONSECUTIVE

FROM TWO

5,6 LCM = 30 BUT THEY ARE CONSECUTIVE AND 5 IS NOT A FACTOR OF 6 AND 5<6 ........INSUFF

I WILL GO FOR A ON THIS ONE
User avatar
cicerone
Joined: 28 Aug 2006
Last visit: 10 May 2019
Posts: 163
Own Kudos:
Posts: 163
Kudos: 311
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Folks the answer is A.
Look at this.
Statement 1: GCD is 2.
mean m=2a and p=2b, where a and b do not have any common factor (if they have a common factor then the GCD will not be 2)i.e a and b are coprimes.

Since p>m , b>a and remember b and a are +ve numbers and coprimes.
Take the least values for a and b ie
a=2 and b=3,
So m=4 and p=6 The remainder is 2>1
Since b-a =1 the remainder =2x1=2
If b-a=2 the remainder will be 2X2=4.
If b-a=3 the remainder will be 2x3=6.If this is > m this will be further divided , but the minimum remainder possible is 2.

So always the remainder is >1.
So it is A.

It is already explainde that Statement 2 alone is not sufficient.
For exmaple
m=5 and p=6 Their LCM = 30 and remainder is 1.
m=15 and p=30 their LCM=30 and remainder is 0.
m=6 and p=10 their LCM=30 and remainder is 4.

So it is not sufficent.

Hence A.
User avatar
Professor
Joined: 29 Dec 2005
Last visit: 09 Aug 2011
Posts: 562
Own Kudos:
Posts: 562
Kudos: 184
Kudos
Add Kudos
Bookmarks
Bookmark this Post
haas_mba07
Professor,
Can you please provide some more insight into problems like these? I get hopelessly lost at such problems.

Professor
only A.

what about if the integers are 5 and 6?


from i, m and p are even integers and p cannot be 2m. so in that case, r >1 when p is divided by m. try plugging some integers.

from ii, LCM of m and p = 30 means m amd p can be any integers that are > 1 and has 30 LCM. for ex: 3 and 10, 5 and 6, 6 and 10, 10 and 15, 6 and 15 or so on..... some of these pairs have r =1 and some have r>1. so insufff...............................

HTH..
User avatar
Futuristic
Joined: 28 Dec 2005
Last visit: 07 May 2009
Posts: 415
Own Kudos:
Posts: 415
Kudos: 52
Kudos
Add Kudos
Bookmarks
Bookmark this Post
this was tricky.....
agree with A
User avatar
haas_mba07
Joined: 02 Jun 2006
Last visit: 26 Jun 2008
Posts: 662
Own Kudos:
Posts: 662
Kudos: 216
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Thanks Cicerone for the great explanation.

I guess when we have such problems referring to GCD, we should try to represent the two numbers as multiples of the GCD.


cicerone
Folks the answer is A.
Look at this.
Statement 1: GCD is 2.
mean m=2a and p=2b, where a and b do not have any common factor (if they have a common factor then the GCD will not be 2)i.e a and b are coprimes.

Since p>m , b>a and remember b and a are +ve numbers and coprimes.
Take the least values for a and b ie
a=2 and b=3,
So m=4 and p=6 The remainder is 2>1
Since b-a =1 the remainder =2x1=2
If b-a=2 the remainder will be 2X2=4.
If b-a=3 the remainder will be 2x3=6.If this is > m this will be further divided , but the minimum remainder possible is 2.

So always the remainder is >1.
So it is A.

It is already explainde that Statement 2 alone is not sufficient.
For exmaple
m=5 and p=6 Their LCM = 30 and remainder is 1.
m=15 and p=30 their LCM=30 and remainder is 0.
m=6 and p=10 their LCM=30 and remainder is 4.

So it is not sufficent.

Hence A.



Archived Topic
Hi there,
This topic has been closed and archived due to inactivity or violation of community quality standards. No more replies are possible here.
Where to now? Join ongoing discussions on thousands of quality questions in our Data Sufficiency (DS) Forum
Still interested in this question? Check out the "Best Topics" block above for a better discussion on this exact question, as well as several more related questions.
Thank you for understanding, and happy exploring!
Moderators:
Math Expert
105388 posts
GMAT Tutor
1924 posts