Events & Promotions
|
|
GMAT Club Daily Prep
Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.
Customized
for You
Track
Your Progress
Practice
Pays
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Sep 1507:00 PM EDT
-09:00 PM EST
Elite scores are possible when you enroll in a powerful GMAT course, taught live online + 6 months access to TTP OnDemand video courses included! Class starts Tues/Thurs Sept. 15, 2026 - Nov. 15, 2027, 7:00pm-9:00pm EST
Sep 2107:00 PM EDT
-10:00 PM EDT
Boost your GMAT score in less than one month in a live online class + 6 months access to TTP OnDemand video courses included! Class starts Mon, Tues, Wed, Thur, Fri Sept. 21, 2026 - Oct. 9, 2027, 7:00pm-10:00pm EST
26 May 2008, 05:52
Kudos
Bookmarks
OA is A
Archived Topic
Hi there,
This topic has been closed and archived due to inactivity or violation of community quality standards. No more replies are possible here.
Where to now? Join ongoing discussions on thousands of quality questions in our Quantitative Questions Forum
Still interested in this question? Check out the "Best Topics" block below for a better discussion on this exact question, as well as several more related questions.
Thank you for understanding, and happy exploring!
26 May 2008, 07:41
Kudos
Bookmarks
silly me, i fell for the trap first ... have to be more careful with calculations
the easiest way is to actually just pick numbers and go ... if k=2, n=27 and remainder is 1. if k=3, n=64 and remainder is 1 ...
stat 2 gives me no info about n, so its clearly out.
the easiest way is to actually just pick numbers and go ... if k=2, n=27 and remainder is 1. if k=3, n=64 and remainder is 1 ...
stat 2 gives me no info about n, so its clearly out.
26 May 2008, 08:18
Kudos
Bookmarks
It is pretty easy
Statement 1:
Can be re-written as: n = K^3 + 1 + 3K(K+1)
When this is Divided by K, we have n/K = K^2 + 3(K+1) + 1/K
So remainder of n/K will be same as 1/K. As given K > 1, so 1/K will always have remainder 1.
This statements is sufficient so answer can be A or D.
Statement 2:
K = 5 and nothing is told about n so this statement on its own is insufficient. So D is also gone.
Answer is A.
Statement 1:
Can be re-written as: n = K^3 + 1 + 3K(K+1)
When this is Divided by K, we have n/K = K^2 + 3(K+1) + 1/K
So remainder of n/K will be same as 1/K. As given K > 1, so 1/K will always have remainder 1.
This statements is sufficient so answer can be A or D.
Statement 2:
K = 5 and nothing is told about n so this statement on its own is insufficient. So D is also gone.
Answer is A.
Archived Topic
Hi there,
This topic has been closed and archived due to inactivity or violation of community quality standards. No more replies are possible here.
Where to now? Join ongoing discussions on thousands of quality questions in our Quantitative Questions Forum
Still interested in this question? Check out the "Best Topics" block above for a better discussion on this exact question, as well as several more related questions.
Thank you for understanding, and happy exploring!
