Welcome to Beat The GMAT, the world's largest GMAT & MBA forum. Please join our rich community of friendly members. Get free help from
experts who teach at the leading GMAT & MBA prep companies — Kaplan, Veritas Prep, Manhattan GMAT and Stacy Blackman Consulting.

Announcement: Apply for the Beat The GMAT/Veritas Prep MBA Fast Track Scholarship, featuring $20,000 in prizes.

DS - Numbers


 
Post new topic   Reply to topic    Beat The GMAT Forum Index -> GMAT Math -> Data Sufficiency
View previous topic :: View next topic  
Author Message
agemroy
Just gettin' started!


Joined: 16 May 2008
Posts: 19

Thanks given: 5
Thanked 0 times in 0 posts


PostPosted: Tue Jul 08, 2008 10:05 am    Post subject: DS - Numbers Reply with quote

If k, m, and t are positive integers and k/6 + m/4 = t/12 , do t and 12 have a common factor greater than 1 ?
(1) k is a multiple of 3.
(2) m is a multiple of 3.

A. Statement (1) ALONE is sufficient, but statement (2) alone is not sufficient.
B. Statement (2) ALONE is sufficient, but statement (1) alone is not sufficient.
C. BOTH statements TOGETHER are sufficient, but NEITHER statement ALONE is sufficient.
D. EACH statement ALONE is sufficient.
E. Statements (1) and (2) TOGETHER are NOT sufficient.

OA is A
Back to top


View user's profile Send private message
AleksandrM
GMAT Destroyer!


Joined: 04 Jan 2008
Posts: 464

Thanks given: 11
Thanked 16 times in 16 posts

Location: Philadelphia
Target GMAT Score: 650

PostPosted: Tue Jul 08, 2008 10:46 am    Post subject: Reply with quote

Simplify and you have: 2K + 3M = T

1) K is at least 3 so 2(3) + 3(1) = T = 9
2(3) + 3(2) = T = 12 and so on and so forth, whatever M is, T and 12 will always have a common factor greater than 1, because any number that is multiplied by three will have 3 as its factor (duh) and when it is added to a number that has a factor of 3, then the two will have a common factor of 3. Sufficient.

2) M is at least 3 so 2(1) + 3(3) = 11 No common factor
2(1) + 3(6) = 20 A common factor of 2. Not sufficient.

Choose A.

_________________
http://second-lap.blogspot.com/
Back to top


View user's profile Send private message Visit poster's website
Thanked by: agemroy
zakir
Just gettin' started!


Joined: 08 Jul 2008
Posts: 2

Thanks given: 0
Thanked 0 times in 0 posts


PostPosted: Tue Jul 08, 2008 10:29 pm    Post subject: Reply with quote

I didn't get this Sad how come you're plugging numbers for m (1,2,etc..) and k?
Back to top


View user's profile Send private message
AleksandrM
GMAT Destroyer!


Joined: 04 Jan 2008
Posts: 464

Thanks given: 11
Thanked 16 times in 16 posts

Location: Philadelphia
Target GMAT Score: 650

PostPosted: Wed Jul 09, 2008 5:15 pm    Post subject: Reply with quote

zakir wrote:
I didn't get this Sad how come you're plugging numbers for m (1,2,etc..) and k?


(1) k is a multiple of 3.

Multiples of 3 are 3, 6, 9, 12, etc.

So, it's easier to plug in 3 for k and get 2(3) + 3(1) = 9

Let me tell you this before I go on. You are looking for a common divisor for T and 12 that is greater than 1.

If K is some multiple of 3, then that is all you need to know because you know for sure that the product of 3M - where M is ANY number - will still give you a sum for T where T and 12 will have a common divisor greater than 1.

However:

(2) m is a multiple of 3.

M could be 3, 6, 9, 12, 15, etc.

However, you do not know whether the product of 2K will give you a sum for T that will have a common divisor for T and 12 greater than 1. As I showed to you above, the sum for T can be prime - in which case it is only divisible by 1 and itself - or a number divisible by 2. Two answers make this statement insufficient.

The reason I used numbers is so you can see the process better. You really don't have to pick numbers at all, you just have to know their properties.

_________________
http://second-lap.blogspot.com/
Back to top


View user's profile Send private message Visit poster's website
lunarpower
GMAT Instructor


Joined: 03 Mar 2008
Posts: 342

Thanks given: 0
Thanked 29 times in 29 posts


GMAT Score: 800

PostPosted: Thu Jul 10, 2008 11:37 pm    Post subject: Re: DS - Numbers Reply with quote

yeah, so you should definitely rephrase the problem by getting rid of the fractions first. you can kill them all by multiplying through by 12, the common denominator of all the fractions:
2k + 3m = t
this is the base equation from which we'll be working to answer the problems.

you can also rephrase the question. if t and 12 have a common factor greater than 12, that's just another way of saying that something that goes into 12 (besides 1) also goes into t. so, here's a rephrase of the prompt question:
does 2, 3, 4, 6, or 12 go into t?
since 4, 6, and 12 are just compounds of the prime factors 2 and 3, it's actually redundant to ask whether those numbers are factors of t. therefore, we can rephrase the question down to its most distilled essence:
does 2 or 3 go into t?

-- statement (1) --
if k is a multiple of 3, then we can write k = 3n, where n is an integer. therefore, we have
2(3n) + 3m = t
6n + 3m = t
since 6n and 3m are both multiples of 3, it follows that 3 goes into t.
sufficient.

-- statement (2) --
if m is a multiple of 3, then we can write m = 3n, where n is an integer. therefore, we have
2k + 3(3n) = t
2k + 9n = t
these (2k and 9n) don't have a common factor, so this is insufficient.
if you want proof of insufficiency, go ahead and plug some easy numbers: if k = n = 1 (which would actually mean k = 1 and m = 3), then t = 11, which doesn't share a common factor with 12. if k = 3 and n = 1 (which would actually mean k = m = 3), then t = 15, which shares the common factor 3 with 12.
insufficient.

answer = a

_________________
ron purewal

instructor, mgmat

Learn more about me
Back to top


View user's profile Send private message
Display posts from previous:   
Post new topic   Reply to topic    Beat The GMAT Forum Index -> GMAT Math -> Data Sufficiency All times are GMT - 7 Hours
Page 1 of 1

 
Jump to:  
You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot vote in polls in this forum
You cannot attach files in this forum
You cannot download files in this forum



"GMAT" and other GMAC™ trademarks are registered trademarks of the Graduate Management Admission Council™. The Graduate Management Admission Council™ does not endorse, nor is it affiliated in any way with the owner or any content on this website. The opinions expressed here are solely those of the author or those of the members of this website. Copyright © 2008 BTG Test Prep, LLC. Powered by phpBB © 2001, 2005 phpBB Group.