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

Redeem

Odds & Evens

This topic has expert replies
Post new topic Post Reply
Previous Topic Next Topic
Master | Next Rank: 500 Posts
Posts: 328
Joined: Thu Aug 07, 2008 5:25 pm
Location: Philadelphia
Thanked: 4 times
GMAT Score:550

Odds & Evens

by Abdulla » Tue Sep 22, 2009 4:09 pm
If w, x, y and z are integers and w + x = y, is y divisible by z?
(1) w and x each have a remainder of 1 when divided by z.
(2) z = 2

OA is C
Abdulla
Top
Source: — Data Sufficiency |
Senior | Next Rank: 100 Posts
Posts: 40
Joined: Mon Feb 16, 2009 8:50 pm
Thanked: 3 times

ans

by crackthetest » Tue Sep 22, 2009 6:31 pm
Ans: C
here is why:
(1) w and x each have a remainder of 1 when divided by z.
w = m(z) + 1
x = n(z) + 1
y = z(m+n) + 2
not sufficient.

(2) z = 2
not sufficient.

(1) & (2) makes y is a multiple of 2, hence y/z => remainder 0.
answer C
Top
Master | Next Rank: 500 Posts
Posts: 328
Joined: Thu Aug 07, 2008 5:25 pm
Location: Philadelphia
Thanked: 4 times
GMAT Score:550

by Abdulla » Tue Sep 22, 2009 7:01 pm
Thanks
Abdulla
Top
Post new topic Post Reply
• Page 1 of 1