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

we will pick new questions that match your level based on your Timer History

Track Your Progress

every week, we’ll send you an estimated GMAT score based on your performance

Practice Pays

we will pick new questions that match your level based on your Timer History

Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.

Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:

Re: GMAT Set 31- 29 [#permalink]
07 Nov 2008, 15:55

both n and k are positive.

dividing (1) by K, we get n/k = 3 + 3/k. Not sufficient enough to answer what the reminder is. So throw out choices A and D

with (2), we only know the value of k, so can't find out what the remainder is. So throw out choice B.

The 2 statements toegther give us n = (5+1)3 = 18 and k = 5. We can definitely say what the remainder is with the 2 statements together. So my pick Choice C

_________________

excellence is the gradual result of always striving to do better

Re: GMAT Set 31- 29 [#permalink]
24 Jan 2009, 15:56

botirvoy wrote:

What is the remainder when the positive integer n is divided by the positive integer k, where k > 1? (1) n = (k+1)^3 (2) k = 5

k=2,5 can be used to test. The remainder is always 1. Rigorous proof is as follows: n=k^3+3k^2+3k+1 Remainder is clearly 1. 1 is sufficient and hence A.

_________________

----------------------- tusharvk

gmatclubot

Re: GMAT Set 31- 29
[#permalink]
24 Jan 2009, 15:56