Hi,
The concept behind this is that if a is divisible by b then, a can be expressed as 'b times some other integer'
a = b * p where p is also an integer.
Stmt 1:
2m is divisible by n.
So, 2m = n * p.
Here, m / n = p / 2. Now, we only know that p is an integer. p/2 may or may not be an integer. Hence, not sufficient.
Stmt 2:
m is divisible by 2n.
So, m = 2n * q; where q is some integer.
Here, m / n = 2 * q. If q itself is an integer, 2q will definitely be an integer. Hence, sufficient.
Hope this helps. Thanks.
DS
This topic has expert replies
Source: Beat The GMAT — Data Sufficiency |
-
4GMAT_Mumbai
- Master | Next Rank: 500 Posts
- Posts: 161
- Joined: Mon Apr 05, 2010 9:06 am
- Location: Mumbai
- Thanked: 37 times












