am getting A
stmnt 1) k = j + 1
=> j and k are consecutive integers and positive.
so the greatest common factor between them will be 1.
(one will be even and one odd)
sufficient
stmnt 2) jk is divisible by 5
if jk=5, say j=5, k=1 gcd: 1
if jk=25, j=5, k=5, gcd:5 or if j=25, k=1, gcd=1
we dont get a unique gcd
not sufficient
hence A
Please explain
This topic has expert replies
Source: Beat The GMAT — Data Sufficiency |
-
scoobydooby
- Legendary Member
- Posts: 1035
- Joined: Wed Aug 27, 2008 10:56 pm
- Thanked: 104 times
- Followed by:1 members












