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

It is currently 20 Oct 2014, 23:52

Close

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

Events & Promotions

Events & Promotions in June
Open Detailed Calendar

What is the reminder when the positive integer n is divided

  Question banks Downloads My Bookmarks Reviews Important topics  
Author Message
TAGS:
Senior Manager
Senior Manager
User avatar
Joined: 21 Apr 2008
Posts: 497
Schools: Kellogg, MIT, Michigan, Berkeley, Marshall, Mellon
Followers: 7

Kudos [?]: 25 [0], given: 13

What is the reminder when the positive integer n is divided [#permalink] New post 13 Oct 2008, 09:06
00:00
A
B
C
D
E

Difficulty:

(N/A)

Question Stats:

0% (00:00) correct 0% (00:00) wrong based on 0 sessions
What is the reminder when the positive integer n is divided by the postivie integer k, where k>1?

(1) n=(k+1)^3

(2) k=5

OA=A

Please, any explanation?

Thank you!

[Edited: the OA is A and not C]
_________________

mates, please visit my profile and leave comments
johnlewis1980-s-profile-feedback-is-more-than-welcome-80538.html

I'm not linked to GMAT questions anymore, so, if you need something, please PM me

I'm already focused on my application package :)

My experience in my second attempt
http://gmatclub.com/forum/p544312#p544312
My experience in my third attempt
630-q-47-v-28-engineer-non-native-speaker-my-experience-78215.html#p588275


Last edited by JohnLewis1980 on 13 Oct 2008, 09:50, edited 1 time in total.
Intern
Intern
avatar
Joined: 30 Sep 2008
Posts: 10
Followers: 0

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

Re: DS: Reminder (source GMAT Prep Soft) [#permalink] New post 13 Oct 2008, 09:40
For statement 1, if K > 1, k could be 2, 3, 4, 5, 6, 7, etc. With k being any of those numbers, when you put K, in the formula and you find n, you can have different remainders for n/k. Therefore not sufficient.

For statement 2, k is 5 we can't find n. Therefore not sufficient.

For both statements, if k is 5, you will get one answer for n. Therefore you can find the remainder for n/k.

Hope that helps.
Senior Manager
Senior Manager
User avatar
Joined: 21 Apr 2008
Posts: 497
Schools: Kellogg, MIT, Michigan, Berkeley, Marshall, Mellon
Followers: 7

Kudos [?]: 25 [0], given: 13

Re: DS: Reminder (source GMAT Prep Soft) [#permalink] New post 13 Oct 2008, 09:49
Sorry Piper, I put the wrong OA.

The right one is A and not C.

I edit the original post

(C is what I chose)

Cheers
_________________

mates, please visit my profile and leave comments
johnlewis1980-s-profile-feedback-is-more-than-welcome-80538.html

I'm not linked to GMAT questions anymore, so, if you need something, please PM me

I'm already focused on my application package :)

My experience in my second attempt
http://gmatclub.com/forum/p544312#p544312
My experience in my third attempt
630-q-47-v-28-engineer-non-native-speaker-my-experience-78215.html#p588275

Current Student
avatar
Joined: 28 Dec 2004
Posts: 3403
Location: New York City
Schools: Wharton'11 HBS'12
Followers: 13

Kudos [?]: 164 [0], given: 2

Re: DS: Reminder (source GMAT Prep Soft) [#permalink] New post 13 Oct 2008, 09:55
JohnLewis1980 wrote:
What is the reminder when the positive integer n is divided by the postivie integer k, where k>1?

(1) n=(k+1)^3

(2) k=5

OA=A

Please, any explanation?

Thank you!

[Edited: the OA is A and not C]


I dont think OA can be A..

n=(K+1)^3, suppose K=2 then 3^3=27/3 remainder is 0..but if K=4, then 5^3/3 has a non-zero remainder..

I think C is the correct answer..
Senior Manager
Senior Manager
User avatar
Joined: 21 Apr 2008
Posts: 497
Schools: Kellogg, MIT, Michigan, Berkeley, Marshall, Mellon
Followers: 7

Kudos [?]: 25 [0], given: 13

Re: DS: Reminder (source GMAT Prep Soft) [#permalink] New post 13 Oct 2008, 10:03
mmm, it could be possible that the GMAT PrepSoft were wrong?

I attached an screen with the OA

Cheers
Attachments

Reminder answer.JPG
Reminder answer.JPG [ 43.73 KiB | Viewed 931 times ]


_________________

mates, please visit my profile and leave comments
johnlewis1980-s-profile-feedback-is-more-than-welcome-80538.html

I'm not linked to GMAT questions anymore, so, if you need something, please PM me

I'm already focused on my application package :)

My experience in my second attempt
http://gmatclub.com/forum/p544312#p544312
My experience in my third attempt
630-q-47-v-28-engineer-non-native-speaker-my-experience-78215.html#p588275

Senior Manager
Senior Manager
User avatar
Joined: 21 Apr 2008
Posts: 497
Schools: Kellogg, MIT, Michigan, Berkeley, Marshall, Mellon
Followers: 7

Kudos [?]: 25 [0], given: 13

Re: DS: Reminder (source GMAT Prep Soft) [#permalink] New post 13 Oct 2008, 10:04
nikhilpoddar wrote:
A


could you please post your explanation?

Thank you
_________________

mates, please visit my profile and leave comments
johnlewis1980-s-profile-feedback-is-more-than-welcome-80538.html

I'm not linked to GMAT questions anymore, so, if you need something, please PM me

I'm already focused on my application package :)

My experience in my second attempt
http://gmatclub.com/forum/p544312#p544312
My experience in my third attempt
630-q-47-v-28-engineer-non-native-speaker-my-experience-78215.html#p588275

Current Student
avatar
Joined: 28 Dec 2004
Posts: 3403
Location: New York City
Schools: Wharton'11 HBS'12
Followers: 13

Kudos [?]: 164 [0], given: 2

Re: DS: Reminder (source GMAT Prep Soft) [#permalink] New post 13 Oct 2008, 10:14
JohnLewis1980 wrote:
mmm, it could be possible that the GMAT PrepSoft were wrong?

I attached an screen with the OA

Cheers


OOPs...OA is Correct..

n=(K+1)^3, suppose n=3^3 then k=2 then remainder is 1..

you will always note that remainder is 1..

A is correct
Senior Manager
Senior Manager
User avatar
Joined: 21 Apr 2008
Posts: 497
Schools: Kellogg, MIT, Michigan, Berkeley, Marshall, Mellon
Followers: 7

Kudos [?]: 25 [0], given: 13

Re: DS: Reminder (source GMAT Prep Soft) [#permalink] New post 13 Oct 2008, 11:12
yes, now it's clearer

This kind of problem is easier to solve using a couple of examples

Cheers
_________________

mates, please visit my profile and leave comments
johnlewis1980-s-profile-feedback-is-more-than-welcome-80538.html

I'm not linked to GMAT questions anymore, so, if you need something, please PM me

I'm already focused on my application package :)

My experience in my second attempt
http://gmatclub.com/forum/p544312#p544312
My experience in my third attempt
630-q-47-v-28-engineer-non-native-speaker-my-experience-78215.html#p588275

SVP
SVP
avatar
Joined: 17 Jun 2008
Posts: 1578
Followers: 12

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

Re: DS: Reminder (source GMAT Prep Soft) [#permalink] New post 13 Oct 2008, 11:16
From stmt1: n = k^2 + 2k + 1 and since the first two terms are divisible by k, the remainder will be 1. Hence, stmt 1 is sufficient.
Manager
Manager
avatar
Joined: 08 Aug 2008
Posts: 234
Followers: 1

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

Re: DS: Reminder (source GMAT Prep Soft) [#permalink] New post 14 Oct 2008, 07:50
hi,
n=(k+1)3 and not (k+1)2 to break it into k^2 +2k+1.
however, (k+1)3 is k^3+1+3k^2+3k--[a^3 +b^3+3ab(a+b)]

the remainder will always be 1.
Director
Director
avatar
Joined: 23 May 2008
Posts: 840
Followers: 3

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

Re: DS: Reminder (source GMAT Prep Soft) [#permalink] New post 14 Oct 2008, 09:50
scthakur wrote:
From stmt1: n = k^2 + 2k + 1 and since the first two terms are divisible by k, the remainder will be 1. Hence, stmt 1 is sufficient.


scthakur...how did you arrive at n = k^2 + 2k + 1 from n = (k+1)^3 ?
Intern
Intern
avatar
Joined: 23 Sep 2008
Posts: 15
Followers: 0

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

Re: DS: Reminder (source GMAT Prep Soft) [#permalink] New post 15 Oct 2008, 00:12
Answer is A. The remanider is always 1. Reason being that (k+1)^3 = K^3+3k^2+2k+1. Hence k is common in all variable except 1. Hence 1 will always be the remainder.
SVP
SVP
avatar
Joined: 17 Jun 2008
Posts: 1578
Followers: 12

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

Re: DS: Reminder (source GMAT Prep Soft) [#permalink] New post 15 Oct 2008, 00:29
bigtreezl wrote:
scthakur wrote:
From stmt1: n = k^2 + 2k + 1 and since the first two terms are divisible by k, the remainder will be 1. Hence, stmt 1 is sufficient.


scthakur...how did you arrive at n = k^2 + 2k + 1 from n = (k+1)^3 ?


My fault. I wrongly read as (k+1)^2. But, even with k+1)^3, all the terms but the last will have k and hence the remainder will always be 1.
Re: DS: Reminder (source GMAT Prep Soft)   [#permalink] 15 Oct 2008, 00:29
    Similar topics Author Replies Last post
Similar
Topics:
What is the reminder when the positive integer x is divided naveenhv 1 25 Apr 2011, 08:22
When positive integer n is divided by 3, the reminder is 2; zaz 3 27 Mar 2009, 09:36
What is the remainder when positive integer N is divided by arjtryarjtry 2 21 Jul 2008, 23:12
What is the remainder when the positive integer n is divided sperumba 9 18 Jan 2006, 18:58
What is the remainder when the positive integer n is divided mandy 9 03 Aug 2005, 05:35
Display posts from previous: Sort by

What is the reminder when the positive integer n is divided

  Question banks Downloads My Bookmarks Reviews Important topics  


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®.