remainder

This topic has expert replies
User avatar
Legendary Member
Posts: 1309
Joined: Mon Apr 04, 2011 5:34 am
Location: India
Thanked: 310 times
Followed by:123 members
GMAT Score:750

remainder

by cans » Wed Jun 08, 2011 3:03 am
What is the remainder when the positive integer n is divided by the positive integer k, where
k>1?
(1) n=(k+1)^3 (i.e. cube of (k+1))
(2) k=5
If my post helped you- let me know by pushing the thanks button ;)

Contact me about long distance tutoring!
[email protected]

Cans!!

User avatar
Master | Next Rank: 500 Posts
Posts: 142
Joined: Mon Jan 10, 2011 8:03 am
Thanked: 19 times

by krishnasty » Wed Jun 08, 2011 3:15 am
cans 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 (i.e. cube of (k+1))
(2) k=5
K has to be greater than 1
hence, let k = 2
1 ) k = 2 and n = 3^3 = 27 --> 27/2 = 1(remainder)
let k = 3 and n = 4^3 = 64 --> 64/3 = 1 (remainder)

Hence, sufficient

2) k = 5
no idea of n.
Hence, insufficient

IMO, A

User avatar
Senior | Next Rank: 100 Posts
Posts: 79
Joined: Mon Jan 17, 2011 4:51 am
Location: Hyderabad, India
Thanked: 8 times
Followed by:5 members

by galaxian » Wed Jun 08, 2011 3:53 am
IMO A, from the same substitution method explained above.

User avatar
Senior | Next Rank: 100 Posts
Posts: 77
Joined: Wed Apr 27, 2011 6:13 am
Location: Hyderabad
Thanked: 10 times
Followed by:2 members
GMAT Score:730

by phanideepak » Wed Jun 08, 2011 6:35 am
1 : (k+1)^3/k = [k^3 + 1 +3k(1+k)]/k so in this only 1 is left out with out a k so the remainder is 1.

Sufficient.

2 : K=5 but we do not know n so insuff

answer is A

Junior | Next Rank: 30 Posts
Posts: 19
Joined: Sat Jun 04, 2011 7:09 am

by magicalhat » Wed Jun 08, 2011 8:42 am
A, imo.
cans 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 (i.e. cube of (k+1))
(2) k=5

GMAT/MBA Expert

User avatar
GMAT Instructor
Posts: 2621
Joined: Mon Jun 02, 2008 3:17 am
Location: Montreal
Thanked: 1090 times
Followed by:355 members
GMAT Score:780

by Ian Stewart » Wed Jun 08, 2011 8:58 am
cans 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 (i.e. cube of (k+1))
(2) k=5
When you expand (k+1)^3, every term you get will be a multiple of k except for the 1^3 = 1 term at the end. So (k+1)^3 will be 1 greater than a multiple of k, and thus the remainder will be 1 when it is divided by k. So the answer is A, since Statement 2 alone is of no help.

In fact, for the same reason, if k > 1, then (k+1)^n will always give you a remainder of 1 when you divide it by k, assuming n and k are positive integers.
For online GMAT math tutoring, or to buy my higher-level Quant books and problem sets, contact me at ianstewartgmat at gmail.com

ianstewartgmat.com

User avatar
Legendary Member
Posts: 1309
Joined: Mon Apr 04, 2011 5:34 am
Location: India
Thanked: 310 times
Followed by:123 members
GMAT Score:750

by cans » Wed Jun 08, 2011 8:27 pm
OA A
If my post helped you- let me know by pushing the thanks button ;)

Contact me about long distance tutoring!
[email protected]

Cans!!

User avatar
Senior | Next Rank: 100 Posts
Posts: 30
Joined: Fri Dec 10, 2010 6:00 am
Thanked: 2 times

by najeeb775 » Sat Jun 11, 2011 2:08 am
Another way of looking at this..
If Reminder(K/n) = r
then Reminder(K^3/n) = Reminder(r^3/n)

Therefore:
Since Reminder((K+1)/K) = 1
Hence Reminder ((K+1)^3/K) = 1^3/K = 1

Hence A alone is sufficient to answer it.

B gives no idea about n.
IMO A

Master | Next Rank: 500 Posts
Posts: 116
Joined: Tue May 31, 2011 7:52 pm
Location: Bangalore, India
Thanked: 2 times
Followed by:2 members

by Sanjay2706 » Sat Jun 11, 2011 5:28 am
A is the answer.

Master | Next Rank: 500 Posts
Posts: 116
Joined: Tue May 31, 2011 7:52 pm
Location: Bangalore, India
Thanked: 2 times
Followed by:2 members

by Sanjay2706 » Sat Jun 11, 2011 5:29 am
A is the answer.