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
GMATLiveTeach 7 seats left
Chris Peckover
NEXT LIVE COHORT

Oct 13 to Jan 7, 2027

with Chris Peckover

Schedule
Tue, Thu · 8:00 to 10:00 PM ET
Included
40 live hours + 6 months of GMAT OnDemand
  • Live instruction and real-time questions
  • Class recordings and assigned practice
View class & 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.

divisibility

Expert replies
by mepinoargote » Mon Aug 09, 2010 3:35 pm
Hi, i always have trouble trying to solve problems like this:

If n is a positive integer, is n^3-n divisible by 4?
(1) n= 2k+1, where k is an integer
(2) n^2 +n is divisible by 6

What´s the best strategy to tackle this type of problems, when divisibility is asked? thanks!
Join the discussion
Source: — Data Sufficiency |

by HPengineer » Mon Aug 09, 2010 4:43 pm
here is how i read this problem.

First thing i notice from the problem stem is that 4 is an even number.... second thing i notice is that N^3-N is = 3 consecutive integers multiplied by each other..

From there you can use rules for odds and evens to determine if 4 is divisible.

Good rules to know
(even)*(even) = divisible by 4
(even)*(even)*(even) = divisible by 8

So we know from problem stem we have (n-1)*(n)*(n+1) or three consecutive integers... Well if n is odd then we know that other two numbers are even therefore divisible by 4

S1 says N = 2K + 1
2 * any number makes an even number... so even + 1 = odd number so N = odd statement is suff

S2 says that n^2 + n
not 100% sure but i think this is insufficient because we cant determine if n is odd or even etc.. or at least i cant determine experts can chime in..

(n)(n+1)/6 means that there are factors of 2 and 3 which doesn't really tell us if n is even or odd

my answer would be A
Join the discussion