BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem

Target Test Prep · GMAT

Choose how you want to prepare

Learn live with an expert or move at your own pace. Every option includes the complete TTP study system.

★★★★★5.0559 reviews
GMATBootcamp Starts Sep 28
Chris Peckover, Target Test Prep GMAT expert
LIVE ONLINE BOOTCAMP

Live Online Bootcamp Class with Top GMAT Expert Chris Peckover

15 live classes from Sep 28, 2026

Schedule
Mon to Fri · 7:00 to 10:00 PM ET
Included
Live classes + 6 months of TTP OnDemand
  • Boost your GMAT score in less than one month in a live online class
  • 6 months access to TTP OnDemand video courses included
View bootcamp & enroll
Limited cohort · enrollment openTarget Test Prep
EALiveTeach 5 seats left
Logan Thompson
EXECUTIVE ASSESSMENT

Sep 6 to Dec 6, 2026

with Logan Thompson

Schedule
Sun · 9:30 AM to 12:30 PM ET
Included
40 hours of live online classes plus six months of access to the complete TTP EA OnDemand course.
  • 165+ EA Score Guarantee
  • 4,100+ Quant, Verbal, and Integrated Reasoning practice questions
  • 400+ hours of in-depth video lessons
  • 3,000+ step-by-step video solutions
View EA class & enroll
Limited cohort · enrollment openTarget Test Prep
GMATOnDemand Start anytime
SELF-PACED MASTERCLASS

Target Test Prep GMAT OnDemand

Complete access from day one. Study on your schedule.

715+ score guarantee
$0to start then $127/mo
  • Personalized study plan and analytics
  • Thousands of lessons and practice questions

Compare the format, schedule, and included access before enrolling. Prices and seat counts shown reflect the supplied offer details.

Am I missing something?

Expert replies
by satish.twincities » Sun Jan 28, 2007 6:13 pm
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

GMAT prep says (1) is sufficent to answer the question.

I wonder how????
Join the discussion
Source: — Data Sufficiency |

by jayhawk2001 » Sun Jan 28, 2007 7:35 pm
N = (k+1)^3 = k^3 + 3k^2 + 3k + 1

So, N/K always yields the remainder 1

Hence (A)
Join the discussion

by 800guy » Sun Jan 28, 2007 7:50 pm
jayhawk2001 wrote:N = (k+1)^3 = k^3 + 3k^2 + 3k + 1

So, N/K always yields the remainder 1

Hence (A)
yep, i got the same approach as jayhawk.
Join the discussion

by aim-wsc » Sun Jan 28, 2007 9:08 pm
good analytical approach FULL MARKS 8)

sigh
i hv forgotten all .. i used other approach like any number that is just greater than one than the other number is not divisible by it and the remainder is always one.
then we have condition A

good
Join the discussion

by rnschmidt » Mon Jan 29, 2007 12:33 pm
will you please explain the math for your solution jay?
Join the discussion

by Stacey Koprince » Wed Jan 31, 2007 5:25 pm
To distribute:
(k+1)^3 = (k+1)(k+1)(k+1)
let's take the first two sets of parentheses first:
(k+1)(k+1) = k^2 + 2k + 1
now, multiple in our third (k+1):
(k+1)(k^2 + 2k + 1) =
k^3 + 2k^2 + k + k^2 + 2k + 1) =
k^3 + 3k^2 + 3k + 1 = n

They ask about n/k, so:
(k^3 + 3k^2 + 3k + 1)
k

= k^2 + 3k + 3 + 1/k. In this algebraic representation of division, the numerator of the fraction is the remainder. So the remainder is always 1.

You can also try some real numbers and see if there's a pattern. We know they're both positive integers and k>1.
Try k = 2. Then n = (2+1)^3 = 27. 27/2 = 13 R1
Try k = 3. Then n = (3+1)^3 = 64. 64/3 = 21 R1
So the first thing I notice is that, when k is even, n is odd, and vice versa. The second thing I notice is that I've gotten R1 for both. Interesting.
k = 4. Then n = (4+1)^3 = 125. 125/4 = 31 R1. R1 again.
k = 5. Then n = (5+1)^3 = 216. 216/5 = 43 R1. R1 yet again!
At this point I'm feeling pretty comfortable that there's a pattern. I'm going to get R1 no matter what I try for k.
Please note: I do not use the Private Messaging system! I will not see any PMs that you send to me!!

Stacey Koprince
GMAT Instructor
Director of Online Community
Manhattan GMAT

Contributor to Beat The GMAT!

Learn more about me
Join the discussion