It is currently 24 Sep 2017, 00:06

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

# gmatprep 2 GCD DS.

Author Message
CEO
Joined: 17 May 2007
Posts: 2950

Kudos [?]: 656 [0], given: 210

### Show Tags

16 Jun 2008, 20:59
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.

Hi guys have a look at this little nasty GCD problem from gmatprep2.
Attachments

gmatprep2-ds1.jpg [ 64.98 KiB | Viewed 883 times ]

Kudos [?]: 656 [0], given: 210

Manager
Joined: 20 Sep 2007
Posts: 106

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

Re: gmatprep 2 GCD DS. [#permalink]

### Show Tags

16 Jun 2008, 21:11

Statement 1 : x is a multiple of 12 , but y can be anything from 0 to 3 and therefore not possible to determine a single greatest common divisor

Statement 2 : if y is a multiple of 12 then x is also a multiple of 12 , can be found from given equation . So greatest common divisor always 12

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

CEO
Joined: 17 May 2007
Posts: 2950

Kudos [?]: 656 [0], given: 210

Re: gmatprep 2 GCD DS. [#permalink]

### Show Tags

16 Jun 2008, 21:34
Is there ever a scenario where GCD could be higher than 12 ??

Kudos [?]: 656 [0], given: 210

Director
Joined: 23 Sep 2007
Posts: 782

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

Re: gmatprep 2 GCD DS. [#permalink]

### Show Tags

16 Jun 2008, 22:02
1
KUDOS
This is DS question #240 of the OG10

Here is the official explanation for statement 2:

statement 2 implies that y is a multiple of of 12 or that 12 is a divisor of y. Since x = 8y + 12, it follows that 12 is a divisor of x, and thus 12 is a common divisor of x and y. Since 12 = x - 8y (rephrase the stem), any common divisor of x and y must be a divisor of 12. Therefore no integer greater than 12 is a common divisor of x and y, and 12 is the GCD of x and y.

this question gets me everytime.

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

SVP
Joined: 29 Aug 2007
Posts: 2473

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

Re: gmatprep 2 GCD DS. [#permalink]

### Show Tags

16 Jun 2008, 23:05
bsd_lover wrote:
Hi guys have a look at this little nasty GCD problem from gmatprep2.

x = 8y +12
from 1: x = 12u
x = 12u = 8y +12
we know nothing about y. nsf.

2: y = 12z
x = 8 (12z) + 12
x = 12 (8z+1)
now we know x and y are multiple of 12. therefore, 12 is the gcd.
12 is gcd because x can only be a multiple of 12 because no matter the value of z, x is 98z plus 12. so the common divisor of x and y is 12.

for ex:

if z = 1, x = 108 and y = 12
if z = 2, x = 204 and y = 24
if z = 3, x = 300 and y = 36
and so on....................
_________________

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

GT

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

Re: gmatprep 2 GCD DS.   [#permalink] 16 Jun 2008, 23:05
Display posts from previous: Sort by