It is currently 17 Dec 2017, 15:46

### 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
Retired Moderator
Joined: 18 Jul 2008
Posts: 959

Kudos [?]: 313 [0], given: 5

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

### Show Tags

23 Nov 2008, 12:07
00:00

Difficulty:

(N/A)

Question Stats:

0% (00:00) correct 100% (00:00) wrong based on 2 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) 2n = 7m

Kudos [?]: 313 [0], given: 5

Manager
Joined: 23 Nov 2008
Posts: 79

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

### Show Tags

23 Nov 2008, 12:34
2
KUDOS
What is the greatest common divisor of positive integers m and n?
1) m is a prime number
2) 2n = 7m

1) GCD can be 1 or m => insuff
2) can be any even m's => insuff
e.g. 2x14 = 7x4 ; GCD:2
e.g. 2x21 = 7x6 ; GCD:3

if GCD is m, then n/m = integer, but n/m=7/2
=> GCD is 1
together suff => C

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

Manager
Joined: 02 Nov 2008
Posts: 58

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

### Show Tags

24 Nov 2008, 12:36
I'm confused between C and E.

I pick C as 1 is common divisior

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

Manager
Joined: 08 Aug 2008
Posts: 229

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

### Show Tags

24 Nov 2008, 23:09
C.
(1) and (2) are clearly insufficient.
combining If 2n=7m and m is a prime, then m has to be 2.(2 is only even prime number) and GCD will be 1.

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

Manager
Joined: 05 Jul 2008
Posts: 136

Kudos [?]: 126 [0], given: 40

GMAT 2: 740 Q51 V38

### Show Tags

25 Nov 2008, 07:35
What is the greatest common divisor of positive integers m and n?

1) m is a prime number

2) 2n = 7m

My choice is B.
2n=7m
n=7k
m=2k (k is an integer)
=> the greatest common divisor of m and n is k or n/7. (or m/2)
I'm not sure...

Kudos [?]: 126 [0], given: 40

Director
Joined: 14 Aug 2007
Posts: 726

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

### Show Tags

25 Nov 2008, 18:33
DavidArchuleta wrote:
My choice is B.
2n=7m
n=7k
m=2k (k is an integer)
=> the greatest common divisor of m and n is k or n/7. (or m/2)
I'm not sure...

but n and m can have different values, so k will keep on changing.

for example:
twilight wrote:
2)
e.g. 2x14 = 7x4 ; GCD:2
e.g. 2x21 = 7x6 ; GCD:3

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

SVP
Joined: 29 Aug 2007
Posts: 2469

Kudos [?]: 868 [0], given: 19

### Show Tags

25 Nov 2008, 19:44
What is the greatest common divisor of positive integers m and n?

1) m is a prime number
2) 2n = 7m

1: m is a prime? what about n? nsf.
2: 2n = 7m?
n could be 7 and m = 2.
n = 14 and m = 4
n = 28 and m = 8

nsf.

1 and 2: m is a prime and 7m = 2n, n must be 7 and m = 2. othert wise 2n cannot be equal to 7m.

therefore, C.
_________________

Gmat: http://gmatclub.com/forum/everything-you-need-to-prepare-for-the-gmat-revised-77983.html

GT

Kudos [?]: 868 [0], given: 19

VP
Joined: 05 Jul 2008
Posts: 1402

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

### Show Tags

25 Nov 2008, 20:18
What is the greatest common divisor of positive integers m and n?

1) m is a prime number

m is prime. n can be any thing but their GCD will always be 1. The only common divisor of a prime number and any other number is 1. How ever if m=n GCD=m=n. Hence insufficient

2) 2n = 7m

n= 7m/2 means m is divisible by 2. so m can be 2, n can be 7 with GCD 1 or m =4 and n =14 and GCD =2. Hence Insufficient

Together, m is prime and 2n=7m implies means m=2. M is the only even prime. m=2 and n=7
GCD=1

C

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

Re: DS: Divisor   [#permalink] 25 Nov 2008, 20:18
Display posts from previous: Sort by
{"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "url": "https://gmatclub.com/forum/what-is-the-greatest-common-divisor-of-positive-integers-m-73216.html?fl=similar", "fetch_time": 1513554380000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2017-51/segments/1512948599156.77/warc/CC-MAIN-20171217230057-20171218012057-00601.warc.gz", "warc_record_offset": 567879803, "warc_record_length": 44882, "token_count": 1535, "char_count": 4261, "score": 4.09375, "int_score": 4, "crawl": "CC-MAIN-2017-51", "snapshot_type": "latest", "language": "en", "language_score": 0.8571842908859253, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00023-of-00064.parquet"}