Check GMAT Club Decision Tracker for the Latest School Decision Releases https://gmatclub.com/AppTrack

 It is currently 28 May 2017, 15:27

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

# Events & Promotions

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

# What is the remainder when the positive integer n is divided

 new topic post reply Question banks Downloads My Bookmarks Reviews Important topics
Author Message
TAGS:

### Hide Tags

Intern
Joined: 09 Dec 2009
Posts: 33
Followers: 0

Kudos [?]: 17 [1] , given: 7

What is the remainder when the positive integer n is divided [#permalink]

### Show Tags

25 Jun 2010, 23:42
1
This post received
KUDOS
11
This post was
BOOKMARKED
00:00

Difficulty:

35% (medium)

Question Stats:

64% (01:58) correct 36% (01:08) wrong based on 391 sessions

### HideShow timer Statistics

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
[Reveal] Spoiler: OA

Last edited by Bunuel on 12 Nov 2012, 03:26, edited 1 time in total.
Renamed the topic and edited the question.
Math Expert
Joined: 02 Sep 2009
Posts: 39037
Followers: 7750

Kudos [?]: 106472 [8] , given: 11626

Re: GMAT prep DS- Remainder [#permalink]

### Show Tags

26 Jun 2010, 08:45
8
This post received
KUDOS
Expert's post
3
This post was
BOOKMARKED
What is the remainder when the positive integer n is divided by the positive integer k, where k>1

(1) $$n=(k+1)^3= k^3 + 3k^2 + 3k + 1=k(k^2+3k+3)+1$$ --> first term, $$k(k^2+3k+3)$$, is obviously divisible by $$k$$ and 1 divide by $$k$$ yields the remainder of 1 (as $$k>1$$). Sufficient.

(2) $$k=5$$. Know nothing about $$n$$, hence insufficient.

Answer: A.
_________________
Intern
Joined: 24 Nov 2008
Posts: 6
Followers: 0

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

Re: GMAT prep DS- Remainder [#permalink]

### Show Tags

26 Jun 2010, 17:06
Yep A. Nice explanation Bunuel.
Kaplan GMAT Instructor
Joined: 21 Jun 2010
Posts: 74
Location: Toronto
Followers: 30

Kudos [?]: 177 [4] , given: 2

Re: GMAT prep DS- Remainder [#permalink]

### Show Tags

29 Jun 2010, 19:33
4
This post received
KUDOS
bunuel's solution is certainly the quickest way to solve. (Of course, it would be (k+1)^3 = k^3 + 3k^2 + 3k + 1, and since each of the "k" terms is divisible by k, the remainder is 1).

But if this deduction/concept didn't jump out at you, you could also solve fairly quickly by picking numbers. If we pick different integer values for k and always end up with the same remainder for n/k, then we can trust that (1) is sufficient. On the other hand, if ever we get different remainder values, we know at once (1) is insufficient:

(1): let k=2. Then, n = (2+1)^3 = 27. 27/2 leaves a remainder of 1.
----let k=3. Then, n = (3+1)^3 = 64. 63 is clearly divisible by 3. Thus, 64/3 leaves a remainder of 1 again.
----let k=4. Then, n = (4+1)^3 = 125. 124 is clearly divisible by 4. Thus, 125/4 leaves a remainder of 1 again.

We've convinced ourselves that (1) is sufficient!
Intern
Joined: 22 Jun 2010
Posts: 42
Followers: 0

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

Re: DS question [#permalink]

### Show Tags

31 Jul 2010, 07:57
Samarth0711 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

Answer given is (A) - Need solution.

1 sufficient

n=3k + 3 ==> reminder is 3
Intern
Joined: 25 Apr 2010
Posts: 5
Followers: 0

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

Re: DS question [#permalink]

### Show Tags

31 Jul 2010, 10:25
Its (k+1) cubed and not 3 multiplied by (K+1)
Intern
Joined: 22 Jun 2010
Posts: 42
Followers: 0

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

Re: DS question [#permalink]

### Show Tags

31 Jul 2010, 10:29
Samarth0711 wrote:
Its (k+1) cubed and not 3 multiplied by (K+1)

it is likely the same

n=(k+1)^3 ==> n=k^3 + 3k²+3k+1 ==> n=k(K²+3k+3) +1 so the reminder is 1

DO you agree ?
Intern
Joined: 12 Jun 2012
Posts: 41
Followers: 1

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

What is the remainder when the positive integer n is divided [#permalink]

### Show Tags

12 Nov 2012, 03:13
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
_________________

If you find my post helpful, please GIVE ME SOME KUDOS!

Math Expert
Joined: 02 Sep 2009
Posts: 39037
Followers: 7750

Kudos [?]: 106472 [1] , given: 11626

Re: What is the remainder when the positive integer n is divided [#permalink]

### Show Tags

12 Nov 2012, 11:03
1
This post received
KUDOS
Expert's post
jordanshl 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

Merging similar topics. Please refer to the solutions above.
_________________
Manager
Joined: 01 Jan 2013
Posts: 64
Location: India
Followers: 0

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

Re: What is the remainder when the positive integer n is divided [#permalink]

### Show Tags

11 Nov 2013, 10:04
JoyLibs 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+1)^3

Take any value of k(for eg 8)
K= 8 ; 9^3/8 = (1^3)/9 = 1(because each value of 9/8 gives remainder 1.Hence 1 X 1 X 1)
k = 2 ; 3^3/2 = (1^3)/2 = 1
etc.A sufficient

b) Insufficient
OA A
GMAT Club Legend
Joined: 09 Sep 2013
Posts: 15501
Followers: 651

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

Re: What is the remainder when the positive integer n is divided [#permalink]

### Show Tags

03 Jan 2015, 10:47
Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.
_________________
GMAT Club Legend
Joined: 09 Sep 2013
Posts: 15501
Followers: 651

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

Re: What is the remainder when the positive integer n is divided [#permalink]

### Show Tags

07 Aug 2016, 23:38
Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.
_________________
Senior Manager
Joined: 26 Oct 2016
Posts: 460
Location: United States
Concentration: Marketing, International Business
Schools: HBS '19
GMAT 1: 770 Q51 V44
GPA: 4
WE: Education (Education)
Followers: 25

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

Re: What is the remainder when the positive integer n is divided [#permalink]

### Show Tags

11 Feb 2017, 10:32
Testluv wrote:
bunuel's solution is certainly the quickest way to solve. (Of course, it would be (k+1)^3 = k^3 + 3k^2 + 3k + 1, and since each of the "k" terms is divisible by k, the remainder is 1).

But if this deduction/concept didn't jump out at you, you could also solve fairly quickly by picking numbers. If we pick different integer values for k and always end up with the same remainder for n/k, then we can trust that (1) is sufficient. On the other hand, if ever we get different remainder values, we know at once (1) is insufficient:

(1): let k=2. Then, n = (2+1)^3 = 27. 27/2 leaves a remainder of 1.
----let k=3. Then, n = (3+1)^3 = 64. 63 is clearly divisible by 3. Thus, 64/3 leaves a remainder of 1 again.
----let k=4. Then, n = (4+1)^3 = 125. 124 is clearly divisible by 4. Thus, 125/4 leaves a remainder of 1 again.

We've convinced ourselves that (1) is sufficient!

Plugging values was an easier way to understand and solve this problem.
_________________

Thanks & Regards,
Anaira Mitch

Re: What is the remainder when the positive integer n is divided   [#permalink] 11 Feb 2017, 10:32
Similar topics Replies Last post
Similar
Topics:
19 What is the remainder when the positive integer n is divided 10 26 Jan 2017, 18:34
28 What is the remainder when the positive integer n is divided 11 04 Jul 2013, 20:07
3 What is the remainder when the positive integer n is divided 4 03 Feb 2016, 12:36
3 What is the remainder when the positive integer n is divided 9 13 Jul 2016, 05:50
38 What is the remainder when the positive integer n is divided 20 01 Mar 2017, 11:04
Display posts from previous: Sort by

# What is the remainder when the positive integer n is divided

 new topic post reply Question banks Downloads My Bookmarks Reviews Important topics

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