|
|
#2 (permalink) |
|
TestMagic Fan!
![]() ![]() Join Date: Aug 2007
Location: India
Posts: 347
![]() |
My approach --->
Statement 1: k = n* 2^6 (where n is some integer) Sufficient. Post edit: It is insufficient. Statement 2: 2 is the only prime factor of k. Sufficient. Answer : Either of the statements are sufficient. (D) Post edit: IMO its B. Made a silly error earlier. OA please! Last edited by coyote : 2007 November 8th at 04:56 AM. |
|
|
|
|
|
#3 (permalink) |
|
Within my grasp!
![]() ![]() Join Date: Mar 2006
Location: Atlanta
Posts: 284
![]() |
IMO B
A being divisible by 2^6 does not imply that it has no other odd factors. it could be 3*2^6 satisfy 1 but cannot be expressed as a power or 2 2. K is greater than and not divisible by any odd number implies it has to be a power of 2 |
|
|
|
|
|
#4 (permalink) | |
|
TestMagic Guru-in-Training
![]() ![]() ![]() Join Date: Oct 2007
Posts: 578
![]() |
Quote:
IMO C Stmt. 1 tells us that k = m * 2^6 Stmt. 2 tells us that k is not divisible by odd>1, combining, m can be 1 or 2^z hence C |
|
|
|
|
|
|
#7 (permalink) | |
|
TestMagic Fan!
![]() ![]() Join Date: Aug 2007
Location: India
Posts: 347
![]() |
Quote:
IMO its B. |
|
|
|
|
Contact TestMagic TestMagic Forums Archive Privacy Statement
TestMagic Locations
Legal
Privacy
SEO by vBSEO 3.2.0
Copyright © 2009 TestMagic
Ad Management by RedTyger