GMAT Prep2?? (Divisible by 3)
This topic has expert replies
Source: Beat The GMAT — Data Sufficiency |
-
akshatsingh
- Senior | Next Rank: 100 Posts
- Posts: 77
- Joined: Thu Apr 10, 2008 10:13 pm
- Thanked: 4 times
-
reetchatha
- Newbie | Next Rank: 10 Posts
- Posts: 7
- Joined: Wed Mar 19, 2008 9:57 am
- Thanked: 1 times
144/n^2 can be 144/2^2 or 144/3^2 where n can be 2 or 3 then how is b sufficient? Am i missing anything here?
Stmt 1 - put n=2 => 4 is not divisble. Put n=3 => 9 is divisible by 3 NOT SUFF
Stmt 2 -
144 = 2*2*2*2*3*3
Since 144/n^2 is an integer than means n can be 2,3 or 4. 3 is divisble by 3. 2 and 4 are not.
NOT SUFF
Together NOT SUFF as n can be 2,3 or 4
IMO E. OA?
Stmt 2 -
144 = 2*2*2*2*3*3
Since 144/n^2 is an integer than means n can be 2,3 or 4. 3 is divisble by 3. 2 and 4 are not.
NOT SUFF
Together NOT SUFF as n can be 2,3 or 4
IMO E. OA?
Sorry Guys..
The question wasn't written correctly..
Is positive integer n divisible by 3?
(1) n^2/36 is an integer
(2) 144/n^2 is an integer
This is the correct question..
Sorry for the inconvenience.....
The question wasn't written correctly..
Is positive integer n divisible by 3?
(1) n^2/36 is an integer
(2) 144/n^2 is an integer
This is the correct question..
Sorry for the inconvenience.....
-
mim3
- Senior | Next Rank: 100 Posts
- Posts: 58
- Joined: Fri Apr 04, 2008 12:36 pm
- Thanked: 4 times
- GMAT Score:680
Agreed- it's A.aatech wrote:Hmmm... That makes sense.. ANS would be A
n^2/36 is an integer that means n is divisible by 6 (3*2)
=> n is divisible by 3 SUFF
Stmt 2 - NOT SUFF -- my earlier explanation stands
1. n^2/36 is an integer
n^2 always going to be a multiple of 36. The only squares that are divisble by 36 are multiples of 6: 6^2. 12^2, 18^2, ect... so n is divisble by 3. Sufficient.
2. 144/n^2 is an integer- n could be either 12 (144/144= 1) or 4 (144/16= 9). Insufficient.

















