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 Starts Oct 17
Chris Peckover, Target Test Prep GMAT expert
LIVE ONLINE CLASSES

Get Ready for GMAT Test Day Faster with Live Online Classes

with Chris Peckover, 100th-Percentile GMAT Scorer

Oct 17 · Chris Peckover
Sat · 11:00 AM to 2:00 PM ET
Oct 20 · Chris Peckover
Tue, Thu · 8:00 to 10:00 PM ET
Oct 25 · Josh Braslow
Sun · 1:00 to 4:00 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
EALiveTeachOnDemand 5 seats left Start anytime
EXECUTIVE ASSESSMENT

Target Test Prep EA OnDemand

Self-paced EA prep. Study on your schedule.

Logan Thompson
EXECUTIVE ASSESSMENT

Sep 6 to Dec 6, 2026

with Logan Thompson

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

Value r

Expert replies
Source: — Data Sufficiency |

by Anurag@Gurome » Wed Feb 22, 2012 7:08 pm
dreamv wrote:If n is a positive integer and r is the remainder when (n-1)(n+1) is divided by 24, what is the value of r ?

1) n is not divisible by 2
2) n is not divisible by 3
(1) n is not divisible by 2.
If n = 1, then (n - 1)(n + 1) = 0 and r = 0
If n = 9, then (n - 1)(n + 1) = 8 * 10 = 80 and r = 8
No definite answer; NOT sufficient.

(2) n is not divisible by 3.
If n = 1, then (n - 1)(n + 1) = 0 and r = 0
If n = 8, then (n - 1)(n + 1) = 7 * 9 = 63 and r = 15
No definite answer; NOT sufficient.

Combining (1) and (2), we know that n is an odd integer so that it is not divisible by 3.
If n = 1, then (n - 1)(n + 1) = 0 and r = 0
If n = 5, then (n - 1)(n + 1) = 4 * 6 = 24 and r = 0
If n = 7, then (n - 1)(n + 1) = 6 * 8 = 48 and r = 0
It can be seen that the remainder is always 0; SUFFICIENT.

The correct answer is C.
Anurag Mairal, Ph.D., MBA
GMAT Expert, Admissions and Career Guidance
Gurome, Inc.
1-800-566-4043 (USA)

Join Our Facebook Groups
GMAT with Gurome
https://www.facebook.com/groups/272466352793633/
Admissions with Gurome
https://www.facebook.com/groups/461459690536574/
Career Advising with Gurome
https://www.facebook.com/groups/360435787349781/
Join the discussion

by pemdas » Wed Feb 22, 2012 9:52 pm
cannot agree more about statements 1 and 2 taken alone.
st(1) n is odd and (n-1)(n+1) is even, returning numerous remainders. Insufficient.
st(2) n can be even too, so the test put by different even numbers shows Insufficiency.

combining st(1&2): n is odd and not divisible by 3.

the product of two consecutive numbers is not always divisible by 3 and we have little chance to determine divisibility by 24 which contains 3 and 8 or (2^3). The product of three consecutive numbers such as (n-1)n(n+1) is on the contrary always divisible by 3. BUT there's one exception to the product of consecutive numbers divisible by 3, which is based on the value of 'n'. If 'n' is even its function (n-1)(n+1) is always divisible by 3. Yet here, we have 'n' constrained to odd value. Again, there's one more room, if 'n' is odd not divisible by 3 it behaves as 'n' even and is always divisible by 3 with the function (n-1)(n+1).

To list we have the first odd value not divisible by 3 given as 1. (1-1)(1+1) is 0 and is divisible by 3 and 24 as well with remainder=0. The next odd not divisible by 3 will be 5 which is just 24 embedded in function (n-1)(n+1). The next number will be n=7, which within (n-1)(n+1)=6*8 contains at least one 3 (divisibility by 3 is ascertained now) and one even factor with at least three 2's. Exactly what we need one 3 and three 2's to have divisibility by 24. Continuing further we get always at least one 3 and three 2's and have divisibility by 24 for all n=odd values not divisible by 3 through the positive infinity.

This is a full-proof of statements(1&2) combined Sufficiency to answer this DS besides episodic tests by Anurag using numbers 1,5,7.

c
Anurag@Gurome wrote:
dreamv wrote:If n is a positive integer and r is the remainder when (n-1)(n+1) is divided by 24, what is the value of r ?

1) n is not divisible by 2
2) n is not divisible by 3
(1) n is not divisible by 2.
If n = 1, then (n - 1)(n + 1) = 0 and r = 0
If n = 9, then (n - 1)(n + 1) = 8 * 10 = 80 and r = 8
No definite answer; NOT sufficient.

(2) n is not divisible by 3.
If n = 1, then (n - 1)(n + 1) = 0 and r = 0
If n = 8, then (n - 1)(n + 1) = 7 * 9 = 63 and r = 15
No definite answer; NOT sufficient.

Combining (1) and (2), we know that n is an odd integer so that it is not divisible by 3.
If n = 1, then (n - 1)(n + 1) = 0 and r = 0
If n = 5, then (n - 1)(n + 1) = 4 * 6 = 24 and r = 0
If n = 7, then (n - 1)(n + 1) = 6 * 8 = 48 and r = 0
It can be seen that the remainder is always 0; SUFFICIENT.

The correct answer is C.
Success doesn't come overnight!
Join the discussion