Find all School-related info fast with the new School-Specific MBA Forum

It is currently 22 Jul 2014, 16: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.

Events & Promotions

Events & Promotions in June
Open Detailed Calendar

What is the greatest common divisor of positive integers m

  Question banks Downloads My Bookmarks Reviews Important topics  
Author Message
TAGS:
Senior Manager
Senior Manager
avatar
Joined: 22 Nov 2005
Posts: 482
Followers: 1

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

GMAT Tests User
What is the greatest common divisor of positive integers m [#permalink] New post 08 Apr 2006, 20:36
00:00
A
B
C
D
E

Difficulty:

(N/A)

Question Stats:

0% (00:00) correct 0% (00:00) wrong based on 0 sessions
What is the greatest common divisor of positive integers m and n?

(1) m is a prime number.
(2) m and n are consecutive integers.
SVP
SVP
avatar
Joined: 14 Dec 2004
Posts: 1711
Followers: 1

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

GMAT Tests User
 [#permalink] New post 08 Apr 2006, 20:57
St1: Insufficient
Since, we don't know about 'n'
eg: (7,21), (7,9)

St2: Sufficient
m, (m+1)
GCD = 1.

So, B.
Manager
Manager
avatar
Joined: 21 Dec 2005
Posts: 105
Followers: 1

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

 [#permalink] New post 08 Apr 2006, 21:14
I agree with Vivek...though I had no idea how to do it.
Manager
Manager
avatar
Joined: 20 Nov 2004
Posts: 109
Followers: 0

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

GMAT Tests User
 [#permalink] New post 10 Apr 2006, 10:34
jodeci wrote:
I agree with Vivek...though I had no idea how to do it.


If you take the Euclidean algorithm to determine the GCD it's quite
obvious. The division of m+1 by m always leaves a remainder of 1.
So no matter what m is, the algorithm always ends in the second
step with GCD(m+1,m) = 1.
Director
Director
User avatar
Joined: 08 Jun 2004
Posts: 502
Location: Europe
Followers: 1

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

GMAT Tests User
 [#permalink] New post 10 Apr 2006, 19:01
'B' by itself is sufficient to answer the question.

In consecutive integers only 1 can be a common divisor.
VP
VP
User avatar
Joined: 29 Apr 2003
Posts: 1408
Followers: 2

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

GMAT Tests User
 [#permalink] New post 10 Apr 2006, 21:16
Good one to test the basics..

Yeah its B
  [#permalink] 10 Apr 2006, 21:16
    Similar topics Author Replies Last post
Similar
Topics:
1 Experts publish their posts in the topic What is the greatest common divisor of positive integers m eybrj2 1 28 Mar 2012, 23:38
5 Experts publish their posts in the topic What is the greatest common divisor of positive integers m lahoosaher 11 07 Jun 2009, 10:12
What is the greatest common divisor of positive integers m mrmikec 4 16 Jun 2006, 21:39
What is the greatest common divisor of positive integers m twixt 4 22 Nov 2004, 06:50
What is the Greatest Common Divisor of positive integers m Guest 2 02 Sep 2004, 23:19
Display posts from previous: Sort by

What is the greatest common divisor of positive integers m

  Question banks Downloads My Bookmarks Reviews Important topics  


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

Powered by phpBB © phpBB Group and phpBB SEO

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