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

It is currently 18 May 2013, 19:52
Customize  |  Hide

What do you think about this problem

  Question banks Downloads My Bookmarks Reviews  
Author Message
TAGS:
Director
Director
User avatar
Joined: 19 Mar 2007
Posts: 529
Followers: 2

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

GMAT Tests User
What do you think about this problem [#permalink] New post 17 Apr 2007, 01:09
00:00

Question Stats:

0% (00:00) correct 0% (00:00) wrong based on 0 sessions
What do you think about this problem?
Attachments

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

Director
Director
User avatar
Joined: 26 Feb 2006
Posts: 919
Followers: 3

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

GMAT Tests User
Re: DS - GMATPrep (remainder) [#permalink] New post 17 Apr 2007, 01:13
nick_sun wrote:
What do you think about this problem?


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

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

 [#permalink] New post 17 Apr 2007, 01:19
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.
Manager
Manager
Joined: 25 Mar 2007
Posts: 82
Followers: 1

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

 [#permalink] New post 17 Apr 2007, 01:27
:lol: 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
Director
User avatar
Joined: 19 Mar 2007
Posts: 529
Followers: 2

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

GMAT Tests User
Re: DS - GMATPrep (remainder) [#permalink] New post 17 Apr 2007, 03:57
Himalayan wrote:
nick_sun wrote:
What do you think about this problem?


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
Senior Manager
Joined: 01 Jan 2007
Posts: 332
Followers: 1

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

GMAT Tests User
Re: DS - GMATPrep (remainder) [#permalink] New post 17 Apr 2007, 06:35
nick_sun wrote:
What do you think about this problem?


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.

Hence answere is A.

Javed.

Cheers!
Re: DS - GMATPrep (remainder)   [#permalink] 17 Apr 2007, 06:35
    Similar topics Author Replies Last post
Similar
Topics:
New posts What do you think about this strategy....? chriswil2005 2 03 Aug 2005, 07:36
New posts 1 What do you think about international trips? darren1010 9 03 May 2007, 04:49
New posts What do you think about this? aurobindo 4 03 Oct 2007, 19:59
New posts What do you think about my chances sher676 0 12 Oct 2009, 22:14
New posts What do you think about this Goog position consultingkid 1 26 Feb 2010, 17:17
Display posts from previous: Sort by

What do you think about this problem

  Question banks Downloads My Bookmarks Reviews  


GMAT Club MBA Forum Home| About| Privacy Policy| Terms and Conditions| GMAT Club Rules| Contact| Sitemap

Powered by phpBB © phpBB Group and phpBB SEO

Kindly note that the GMAT® test is a registered trademark of the Graduate Management Admission Council®, and this site has neither been reviewed nor endorsed by GMAC®.