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 21
Chris Peckover, Target Test Prep GMAT expert
LIVE ONLINE BOOTCAMP

Live Online Bootcamp Class with Top GMAT Expert Chris Peckover

Sep 21 to Oct 9, 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.

PS

Expert replies
by ketkoag » Mon Mar 30, 2009 8:37 am
If n is an integer greater than 6, which of the following must be divisible by 3?
A. n (n+1) (n-4)
B. n (n+2) (n-1)
C. n (n+3) (n-5)
D. n (n+4) (n-2)
E. n (n+5) (n-6)

I got the right answer but i put values and then check and i took more than 3 mins to solve it.
Please lemme know if there is any short and reliable method.
OA: A
Join the discussion
Source: — Problem Solving |

by moutar » Mon Mar 30, 2009 8:45 am
If we look at each section of these options modulo 3, they all need to be different.

A. 0 1 2 or 1 2 0 or 2 0 1
B. 0 2 2 or 1 0 0 or 2 1 1
C. 0 0 1 or 1 1 2 or 2 2 0
D. 0 1 1 or 1 2 2 or 2 0 0
E. 0 2 0 or 1 0 1 or 2 1 2

Therefore its A.
Join the discussion

Re: PS

by Vemuri » Mon Mar 30, 2009 9:30 am
I will be interested to see any short method to solve this problem. I plugged in numbers greater than 6 & found only A satisying the condition. I took less than 2mins to solve this problem. Basically I was checking for any of the 3 numbers to be multiple of 3 while solving.
Join the discussion

by ketkoag » Mon Mar 30, 2009 11:14 am
moutar, could u please elaborate on ur explaination.
vemuri, i did it the same way u did and it took me long coz i double checked each option as it was a bit tricky to use trial and error in the timed conditiond. thanks for ur reply.
Join the discussion

by moutar » Mon Mar 30, 2009 11:20 am
You can have 3 types of number.
- a multiple of three (0)
- one more than a multiple of 3 (1)
- two more than a multiple of 3 (2)

The multiplication needs to contain a multiple of 3 (i.e. a zero).

The list contains all the possible options. The only one that is guaranteed to contain a multiple of 3 is A.
Join the discussion

by shargaur » Tue Apr 07, 2009 5:13 pm
There is rule regarding multiple of 3. If sum of digits are divided by 3 then it is multiple of 3.

A. n (n+1) (n-4) = 3n - 3
B. n (n+2) (n-1) = 3n + 1
C. n (n+3) (n-5) = 3n -2
D. n (n+4) (n-2) = 3n + 2
E. n (n+5) (n-6) = 3n - 1

Except (A) no matter what value of n may be it will never be multiple of 3. it can only be mulitple of 3 if either 3 is subtracted or added to 3n.

Hope it helps

Took less than 20 secs.
Join the discussion

by Vemuri » Tue Apr 07, 2009 6:01 pm
shargaur wrote:There is rule regarding multiple of 3. If sum of digits are divided by 3 then it is multiple of 3.

A. n (n+1) (n-4) = 3n - 3
B. n (n+2) (n-1) = 3n + 1
C. n (n+3) (n-5) = 3n -2
D. n (n+4) (n-2) = 3n + 2
E. n (n+5) (n-6) = 3n - 1

Except (A) no matter what value of n may be it will never be multiple of 3. it can only be mulitple of 3 if either 3 is subtracted or added to 3n.

Hope it helps

Took less than 20 secs.
Nice try shargaur. But, don't you think the rule is for adding digits of a number to see if it is a multiple of 3? For ex: 27. We can determine if this number is a multiple of 3 by adding the units & tens digit 2+7 = 9, which is a multiple of 3, hence 27 is a multiple of 3.

When we are dealing with numbers that are multiplying each other (like what is being asked in the question), this rule will not apply.

ex: n(n+2)(n-1). According to what you said, this can be converted to 3n+1 & hence not a multiple of 3. But, when you use a number n=7, this expression is a multiple of 3 (7*9*6), which negates your answer.

Appreciate if you can explain your reasoning.
Join the discussion