Last visit was: 19 Nov 2025, 02:23 It is currently 19 Nov 2025, 02:23
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.
Close
Request Expert Reply
Confirm Cancel
User avatar
JohnLewis1980
Joined: 21 Apr 2008
Last visit: 04 Nov 2010
Posts: 286
Own Kudos:
Given Kudos: 13
Concentration: Industrial Sector
Schools:Kellogg, MIT, Michigan, Berkeley, Marshall, Mellon
Posts: 286
Kudos: 104
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
piper
Joined: 30 Sep 2008
Last visit: 22 Nov 2008
Posts: 6
Own Kudos:
Posts: 6
Kudos: 1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
JohnLewis1980
Joined: 21 Apr 2008
Last visit: 04 Nov 2010
Posts: 286
Own Kudos:
Given Kudos: 13
Concentration: Industrial Sector
Schools:Kellogg, MIT, Michigan, Berkeley, Marshall, Mellon
Posts: 286
Kudos: 104
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
FN
User avatar
Current Student
Joined: 28 Dec 2004
Last visit: 07 May 2012
Posts: 1,576
Own Kudos:
Given Kudos: 2
Location: New York City
Concentration: Social Enterprise
Schools:Wharton'11 HBS'12
Posts: 1,576
Kudos: 675
Kudos
Add Kudos
Bookmarks
Bookmark this Post
JohnLewis1980
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..
User avatar
JohnLewis1980
Joined: 21 Apr 2008
Last visit: 04 Nov 2010
Posts: 286
Own Kudos:
Given Kudos: 13
Concentration: Industrial Sector
Schools:Kellogg, MIT, Michigan, Berkeley, Marshall, Mellon
Posts: 286
Kudos: 104
Kudos
Add Kudos
Bookmarks
Bookmark this Post
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 2141 times ]

User avatar
JohnLewis1980
Joined: 21 Apr 2008
Last visit: 04 Nov 2010
Posts: 286
Own Kudos:
Given Kudos: 13
Concentration: Industrial Sector
Schools:Kellogg, MIT, Michigan, Berkeley, Marshall, Mellon
Posts: 286
Kudos: 104
Kudos
Add Kudos
Bookmarks
Bookmark this Post
nikhilpoddar
A

could you please post your explanation?

Thank you
User avatar
FN
User avatar
Current Student
Joined: 28 Dec 2004
Last visit: 07 May 2012
Posts: 1,576
Own Kudos:
Given Kudos: 2
Location: New York City
Concentration: Social Enterprise
Schools:Wharton'11 HBS'12
Posts: 1,576
Kudos: 675
Kudos
Add Kudos
Bookmarks
Bookmark this Post
JohnLewis1980
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
User avatar
JohnLewis1980
Joined: 21 Apr 2008
Last visit: 04 Nov 2010
Posts: 286
Own Kudos:
Given Kudos: 13
Concentration: Industrial Sector
Schools:Kellogg, MIT, Michigan, Berkeley, Marshall, Mellon
Posts: 286
Kudos: 104
Kudos
Add Kudos
Bookmarks
Bookmark this Post
yes, now it's clearer

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

Cheers
User avatar
scthakur
Joined: 17 Jun 2008
Last visit: 30 Jul 2009
Posts: 609
Own Kudos:
Posts: 609
Kudos: 449
Kudos
Add Kudos
Bookmarks
Bookmark this Post
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.
User avatar
prasun84
Joined: 08 Aug 2008
Last visit: 04 Mar 2012
Posts: 124
Own Kudos:
Posts: 124
Kudos: 349
Kudos
Add Kudos
Bookmarks
Bookmark this Post
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.
User avatar
bigtreezl
Joined: 23 May 2008
Last visit: 30 Jul 2009
Posts: 365
Own Kudos:
Posts: 365
Kudos: 189
Kudos
Add Kudos
Bookmarks
Bookmark this Post
scthakur
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 ?
User avatar
anuprajan5
Joined: 23 Sep 2008
Last visit: 02 Jun 2015
Posts: 10
GMAT 1: 700 Q48 V38
Posts: 10
Kudos: 0
Kudos
Add Kudos
Bookmarks
Bookmark this Post
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.
User avatar
scthakur
Joined: 17 Jun 2008
Last visit: 30 Jul 2009
Posts: 609
Own Kudos:
Posts: 609
Kudos: 449
Kudos
Add Kudos
Bookmarks
Bookmark this Post
bigtreezl
scthakur
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.



Archived Topic
Hi there,
This topic has been closed and archived due to inactivity or violation of community quality standards. No more replies are possible here.
Where to now? Join ongoing discussions on thousands of quality questions in our Data Sufficiency (DS) Forum
Still interested in this question? Check out the "Best Topics" block above for a better discussion on this exact question, as well as several more related questions.
Thank you for understanding, and happy exploring!
Moderators:
Math Expert
105379 posts
GMAT Tutor
1924 posts