y is s and x is r, now rewrite everything --> s=3r+2 OR 3r+2-s=0
st(1) BECOMES ridiculously simple ( 3r+2-s)(4r+9-s) = 0 is Not Sufficient, because we have also (4r+9-s) can be 0
st(2) (4r-6-s)(3r+2-s) =0; (3r+2-s) =0 ? Not Sufficient
Combined st(1&2): both ( 3r+2-s)(4r+9-s) = 0 AND (4r-6-s)(3r+2-s) =0 can be zero if one of common factors is 0 (zero). Only possible with the ( 3r+2-s) = 0 why not Sufficient?
IOM C
Cheers
Gmat Prep Toughie
This topic has expert replies
Source: Beat The GMAT — Data Sufficiency |
-
Night reader
- Legendary Member
- Posts: 1337
- Joined: Sat Dec 27, 2008 6:29 pm
- Thanked: 127 times
- Followed by:10 members
Night reader wrote:y is s and x is r, now rewrite everything --> s=3r+2 OR 3r+2-s=0
st(1) BECOMES ridiculously simple ( 3r+2-s)(4r+9-s) = 0 is Not Sufficient, because we have also (4r+9-s) can be 0
st(2) (4r-6-s)(3r+2-s) =0; (3r+2-s) =0 ? Not Sufficient
Combined st(1&2): both ( 3r+2-s)(4r+9-s) = 0 AND (4r-6-s)(3r+2-s) =0 can be zero if one of common factors is 0 (zero). Only possible with the ( 3r+2-s) = 0 why not Sufficient?
IOM C
Cheers
Thanks Dude..
