Live GMAT classes with Target Test Prep start Nov 21 and Nov 22. First class free.

See classes
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.

Newsweek Readers’ Choice Awards 2026 winner: Target Test Prep, #1 Test Prep

Target Test Prep was voted #1 Best Test Prep in the 2026 Newsweek Readers’ Choice™ Awards.

★★★★★5.0563 reviews
GMATLiveTeachStarts Nov 22
Josh Braslow, Target Test Prep GMAT expert
LIVE ONLINE CLASSES

Get Ready for GMAT Test Day Faster with Live Online Classes

with Josh Braslow, 20+ years in test prep

Nov 22 · Josh Braslow
Sun · 9:30 AM to 12:30 PM ET
Included
40 hours of live online classes + 6 months of TTP OnDemand
  • Attend the first class for free
  • Every class is recorded, so you never fall behind
View classes & enroll
Limited seats availableTarget Test Prep
EALiveTeachOnDemandStart anytime
EXECUTIVE ASSESSMENT

Target Test Prep EA OnDemand

Self-paced EA prep. Study on your schedule.

EXECUTIVE ASSESSMENT

with

165+ EA score guarantee
$05-day trial no automatic billing
Schedule
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 Start free 5-day trial
Limited cohort · enrollment openTrial includes full course accessTarget Test Prep
GMATOnDemandStart 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

The Maestros of Numbers, Kill This

Expert replies
by dtweah » Sun May 10, 2009 4:53 am
There are how many integers n, n > 3, such that (n – 3) divides (n2 – n)?

(a) 1
(b) 2
(c) 3
(d) More than 3 but a finite number
(e) infinitely many
Join the discussion
Source: — Problem Solving |

Re: The Maestros of Numbers, Kill This

by Pranay » Sun May 10, 2009 5:15 am
dtweah wrote:There are how many integers n, n > 3, such that (n – 3) divides (n2 – n)?

(a) 1
(b) 2
(c) 3
(d) More than 3 but a finite number
(e) infinitely many
My answer would be D.

My interpretation is [n^2 -n]/(n-3) leaves no remainder for how many numbers ??


I reduced the above equation to [n(n-1)]/(n-3), and then substituted different values,

I saw that 4,5,6,9 satisfied the given condition and thus D. :)

Please correct if wrong.
Join the discussion

Re: The Maestros of Numbers, Kill This

by Vemuri » Sun May 10, 2009 7:04 am
IMO D. Did a manual check. I hope there is a smart way of answering this problem.
Join the discussion

by mikeCoolBoy » Sun May 10, 2009 8:14 am
IMO D

N^2 - N can be written as N(N-1) so we need to find values of N in which N-3 divides N(N-1)

Let's assume that N= X + 3 and therefore N-1 = X + 2 and N - 3 = X

the new equation can be written as

(X+3)(X+2) / X ---> X^2 + 5X + 6 / X . This is true if X is a factor of 6 so X values can be {1,2,3,6} which is a finite set of numbers.

Can an expert check if my solution is correct?
Join the discussion

Re: The Maestros of Numbers, Kill This

by dtweah » Sun May 10, 2009 8:15 am
Vemuri wrote:IMO D. Did a manual check. I hope there is a smart way of answering this problem.
Yes there is:

Do the long division:
n2-n/n-3= n + 2 + 6/(n-3). You see that for n>9, you cant' get an integer. So D
Join the discussion

Re: The Maestros of Numbers, Kill This

by Vemuri » Sun May 10, 2009 8:30 am
dtweah wrote:Do the long division:
n2-n/n-3= n + 2 + 6/(n-3). You see that for n>9, you cant' get an integer. So D
I actually did the long division when first attempting the question. This is what I did:

(n-3)(n+2) + 6 = n^2-n

But, I did not know what to do next to simplyfy & quickly answer the question. So, went about checking the answer manually :roll:
Join the discussion

by sureshbala » Sun May 10, 2009 10:02 pm
Given that n^2 - n is divisible by n-3

In questions like these try to express n^2 - n as as a combination of
n-3 .

We have n^2 - n = (n-3)(n+2) + 6

Now (n-3)(n+2) + 6 must be divisible by n-3

Since (n-3)(n+2) is divisible by n-3, 6 must be divisible by n-3.

So we can conclude that for n^2-n to be divisible by n-3, 6 must be divisible by n-3.

So n-3 can take the values of all the factors of 6 i.e. 1, 2, 3 and 6.

Hence n = 4, 5, 6 and 9.

Also given that n > 3 and all the above values satisfy this condition.

So n take only 4 values
Join the discussion