BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem

factor problem .

This topic has expert replies
Post new topic Post Reply
Previous Topic Next Topic
Source: — Problem Solving |
User avatar
GMAT Instructor
Posts: 1248
Joined: Thu Mar 29, 2012 2:57 pm
Location: Everywhere
Thanked: 503 times
Followed by:192 members
GMAT Score:780

by Bill@VeritasPrep » Wed Apr 04, 2012 8:19 pm
S1) j and k are consecutive integers, and consecutive integers share no factors except for 1. Sufficient.

S2) This leaves many possibilities. If jk=20, j=10 and k=2, the greatest common factor is 2. If jk=20, j=4 and k=5, the greatest common factor is 1. Insufficient.
Join Veritas Prep's 2010 Instructor of the Year, Matt Douglas for GMATT Mondays

Visit the Veritas Prep Blog

Try the FREE Veritas Prep Practice Test
Top
Newbie | Next Rank: 10 Posts
Posts: 5
Joined: Thu Apr 05, 2012 7:05 pm
Thanked: 1 times

by dchhikara863 » Thu Apr 05, 2012 11:18 pm
Guess we could take the reverse route and see if we can eliminate by statements by proving insufficiency.

S1. j = k+1. try picking nos. (2,3) (3,4) (4,5) you'll also find that they're consecutive integers. The integers being odd and even the greatest common factor is always 1. So 1 always being the answer makes it sufficient.

S2. jk divisible by 5. Again substitute nos. for jk. jk could be 5,10,15,20,25. Were j and k both 5 then largest common factor would be 5. In other cases such as 10,15 the largest common factor of j n k (2,5) (3,5) would be one. so there is more than one answer for the largest factor. Makes the statement insufficient.

Got to be really mindful of not getting influenced by the first statement when solving for the second one.
Top
Post new topic Post Reply
• Page 1 of 1