Find all School-related info fast with the new School-Specific MBA Forum

 It is currently 04 Jul 2015, 01:26

### 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

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

Track

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

# Events & Promotions

###### Events & Promotions in June
Open Detailed Calendar

Author Message
TAGS:
Director
Joined: 19 Mar 2007
Posts: 524
Followers: 3

Kudos [?]: 8 [0], given: 0

00:00

Difficulty:

(N/A)

Question Stats:

0% (00:00) correct 0% (00:00) wrong based on 0 sessions
Attachments

N divided by K.JPG [ 9.54 KiB | Viewed 557 times ]

Director
Joined: 26 Feb 2006
Posts: 905
Followers: 4

Kudos [?]: 58 [0], given: 0

Re: DS - GMATPrep (remainder) [#permalink]  17 Apr 2007, 00:13
nick_sun wrote:

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.
Manager
Joined: 25 Mar 2007
Posts: 82
Followers: 1

Kudos [?]: 5 [0], given: 0

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

Manager
Joined: 25 Mar 2007
Posts: 82
Followers: 1

Kudos [?]: 5 [0], given: 0

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.
Director
Joined: 19 Mar 2007
Posts: 524
Followers: 3

Kudos [?]: 8 [0], given: 0

Re: DS - GMATPrep (remainder) [#permalink]  17 Apr 2007, 02:57
Himalayan wrote:
nick_sun wrote:

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.

I've got it. Thank you, Himalayan!
Senior Manager
Joined: 01 Jan 2007
Posts: 326
Followers: 1

Kudos [?]: 19 [0], given: 0

Re: DS - GMATPrep (remainder) [#permalink]  17 Apr 2007, 05:35
nick_sun wrote:

From statement 1 we have n= k^3+ 3k^2 + 3k +1. and we have to fine n/k. that is (k^3+ 3k^2 + 3k +1)/k that is equal to k^2 +3k +3 + 1/k . Also in the question stem it is given that k is >1 so the remainder of n/k is 1. So sufficient

Statement 2 says that k=5. But no information of n is given and hence this statement alone is insuficient.

Javed.

Cheers!
Re: DS - GMATPrep (remainder)   [#permalink] 17 Apr 2007, 05:35
Similar topics Replies Last post
Similar
Topics:
From Barron's Gmat I think should be A What do you think? My 1 02 Nov 2011, 07:31
I think i saw this problem somewhere but couldn't find. Can 2 03 Sep 2009, 09:42
How do I do this problem 2 26 Jul 2009, 12:54
How do I crack this problem... 5 22 Jul 2006, 15:43
Display posts from previous: Sort by