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.
May 1408:30 AM PDT
-09:30 AM PDT
Most GMAT test-takers are intimidated by the hardest GMAT Verbal questions. In this session, Target Test Prep GMAT instructor Erika Tyler-John, a 100th percentile GMAT scorer, will show you how top scorers break down challenging Verbal questions..
May 1212:00 PM EDT
-11:59 PM EDT
Make the most of your break with the most realistic GMAT™ prep. Take up to $700 off select products.- May 13
08:30 AM PDT
-09:30 AM PDT
In Episode 4 of our GMAT Ninja CR series, we tackle the most intimidating CR question type: Boldface & "Legalese" questions. If you've ever stared at an answer choice that reads, "The first is a consideration introduced to counter a position that... - Jun 10
06:00 AM PDT
-06:15 PM PDT
Register for the GMAT Club Virtual MBA Spotlight Fair – the world’s premier event for serious MBA candidates. This is your chance to hear directly from Admissions Directors at nearly every Top 30 MBA program..
17 Apr 2007, 01:09
Kudos
Bookmarks
N
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!
Difficulty:
(N/A)
Question Stats:
0% (00:00) correct
0%
(00:00)
wrong
based on 0
sessions
History
Date
Time
Result
Not Attempted Yet
What do you think about this problem?
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 Data Sufficiency (DS) 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!
17 Apr 2007, 01:13
Kudos
Bookmarks
nick_sun
A.
statement 1 is suff. if n = (k+1)^3, n = (k+1)(k+1)(k+1) in which every term, (k+1), has reminder 1 if divided by k. therefore, all reminders have a product of 1. so suff.
statement 2 is not suff. k =5 but n could be any integers.
17 Apr 2007, 01:19
Kudos
Bookmarks
1. n = (k+1)^3 since we don't know what n is nor k, there are too many possiblities - therefore insufficient
2. k = 5 Again, many possiblities (we have no value for n)
Together: if k=5, then n=(5+1)^3 = 6^3 = 216
if n = 216, and k = 5 , we can get the remainder (216/5) so sufficient
My answer is C.
2. k = 5 Again, many possiblities (we have no value for n)
Together: if k=5, then n=(5+1)^3 = 6^3 = 216
if n = 216, and k = 5 , we can get the remainder (216/5) so sufficient
My answer is C.
Himalayan is absolutely correct - my bad. Sometimes I jump into the dark void that is math without turning on the flashlight. Please disregard my answer it's wrong. 
