Summer is Coming! Join the Game of Timers Competition to Win Epic Prizes. Registration is Open. Game starts Mon July 1st.

 It is currently 17 Jul 2019, 16:11

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

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

Author Message
TAGS:

### Hide Tags

Intern
Joined: 09 Dec 2009
Posts: 25
What is the remainder when the positive integer n is divided  [#permalink]

### Show Tags

Updated on: 12 Nov 2012, 03:26
4
13
00:00

Difficulty:

35% (medium)

Question Stats:

68% (01:26) correct 32% (01:32) wrong based on 417 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

Originally posted by JoyLibs on 25 Jun 2010, 23:42.
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: 56277
Re: GMAT prep DS- Remainder  [#permalink]

### Show Tags

26 Jun 2010, 08:45
11
5
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.

_________________
Kaplan GMAT Instructor
Joined: 21 Jun 2010
Posts: 69
Location: Toronto
Re: GMAT prep DS- Remainder  [#permalink]

### Show Tags

29 Jun 2010, 19:33
6
1
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!
##### General Discussion
Intern
Joined: 24 Nov 2008
Posts: 6
Re: GMAT prep DS- Remainder  [#permalink]

### Show Tags

26 Jun 2010, 17:06
Yep A. Nice explanation Bunuel.
Intern
Joined: 22 Jun 2010
Posts: 33

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

### Show Tags

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

### 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 ?
Manager
Joined: 01 Jan 2013
Posts: 50
Location: India
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
Director
Joined: 26 Oct 2016
Posts: 626
Location: United States
Schools: HBS '19
GMAT 1: 770 Q51 V44
GPA: 4
WE: Education (Education)
Re: What is the remainder when the positive integer n is divided  [#permalink]

### Show Tags

11 Feb 2017, 10:32
1
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
Manager
Joined: 04 Jun 2017
Posts: 100
Location: India
Concentration: Strategy, Operations
GMAT 1: 500 Q39 V20
GPA: 3.82
Re: What is the remainder when the positive integer n is divided  [#permalink]

### Show Tags

15 Jun 2019, 20:39
A is sufficient

n = (k + 1 )^3
Randomly put values k > 1 i.e. 2,3,4,5,6,7 ...........
n = (2+1)^3 = 27
n/k = 27/2 = remainder 1

same as for 3,4,5,6,7,8...........

so A is sufficient

B. no details available

Re: What is the remainder when the positive integer n is divided   [#permalink] 15 Jun 2019, 20:39
Display posts from previous: Sort by