Check GMAT Club Decision Tracker for the Latest School Decision Releases https://gmatclub.com/AppTrack

 It is currently 24 May 2017, 19:51

### 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

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

# Events & Promotions

###### Events & Promotions in June
Open Detailed Calendar

# What is the greatest common divisor of positive integers m

Author Message
Senior Manager
Joined: 22 Nov 2005
Posts: 474
Followers: 2

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

What is the greatest common divisor of positive integers m [#permalink]

### Show Tags

08 Apr 2006, 21:36
00:00

Difficulty:

(N/A)

Question Stats:

0% (00:00) correct 0% (00:00) wrong based on 0 sessions

### HideShow timer Statistics

This topic is locked. If you want to discuss this question please re-post it in the respective forum.

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
Joined: 14 Dec 2004
Posts: 1692
Followers: 3

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

### Show Tags

08 Apr 2006, 21: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
Joined: 21 Dec 2005
Posts: 102
Followers: 1

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

### Show Tags

08 Apr 2006, 22:14
I agree with Vivek...though I had no idea how to do it.
Manager
Joined: 20 Nov 2004
Posts: 108
Followers: 0

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

### Show Tags

10 Apr 2006, 11: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.
Senior Manager
Joined: 08 Jun 2004
Posts: 495
Location: Europe
Followers: 1

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

### Show Tags

10 Apr 2006, 20:01
'B' by itself is sufficient to answer the question.

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

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

### Show Tags

10 Apr 2006, 22:16
Good one to test the basics..

Yeah its B
10 Apr 2006, 22:16
Display posts from previous: Sort by