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.

DIVISIBILITY AND REMAINDERS

Expert replies
Source: — Data Sufficiency |

by RoadtoIVY » Tue Nov 17, 2009 1:52 pm
N IS A POSITIVE NUMBER AND R IS THE REMAINDER WHEN 4+7N IS DIVIDED BY 3. WHAT IS THE VALUE OF R?

1) N+1 IS DIVISIBLE BY 3
2)N > 20

1) is sufficient: Since N+1 is divisible by 3, N can be 2, 5, 8, 11 .... Let's try each one of them
N=2, then 4+7N = 4+14 = 18 >> 18 div 3 = remainder = 0
Similarly you get 0, if you try N = 5,8,11,14...

2) not sufficient since N>20 means, N can be 21,22,23,24...etc which does not give the same remainder.

Hope it heps.
Join the discussion

by hpgmat » Tue Nov 17, 2009 3:49 pm
THANK YOU. I GUESS PLUGGING IN NUMBERS IS NOT A BAD STRATEGY AFTER ALL
Will Win
Join the discussion

by adam15 » Tue Nov 17, 2009 8:05 pm
4+7N=3*c+R where c is an integer.(1)
1+N+3+6N=3*c+R
1+N=-3-6N+3*c+R
1+N=3*(c-2N)+R-3
by 1 we know that N+1=3*d where d is an integer
then we know that R-3=0 then R=3.
subsituting in (1)
yields 4+7*N=3*(c+1)
put c+1=e
4+7*N=3d
reminder is 0
then 1 is sufficient
2 is not
Join the discussion

by palvarez » Tue Nov 17, 2009 10:59 pm
hpgmat wrote:N IS A POSITIVE NUMBER AND R IS THE REMAINDER WHEN 4+7N IS DIVIDED BY 3. WHAT IS THE VALUE OF R?

1) N+1 IS DIVISIBLE BY 3
2)N > 20
Forget about verbal reasoning when you come to this kind of problems. Set up algebraically, using modulus, etc.

4+7n = r (3)

1 + n = r (3)

1. n +1 = 0 (mod 3)
n = 2 (mod 3)
r = n+1 (mod 3) = 3 (mod 3) = 0 Sufficient.

2. n > 20, we need to know n (mod 3). Useless.

A is sufficient.
Join the discussion

by hpgmat » Wed Nov 18, 2009 1:13 am
palvarez wrote:
hpgmat wrote:N IS A POSITIVE NUMBER AND R IS THE REMAINDER WHEN 4+7N IS DIVIDED BY 3. WHAT IS THE VALUE OF R?

1) N+1 IS DIVISIBLE BY 3
2)N > 20
Forget about verbal reasoning when you come to this kind of problems. Set up algebraically, using modulus, etc.

4+7n = r (3)

1 + n = r (3)

1. n +1 = 0 (mod 3)
n = 2 (mod 3)
r = n+1 (mod 3) = 3 (mod 3) = 0 Sufficient.

2. n > 20, we need to know n (mod 3). Useless.

A is sufficient.
I believe r in your equations represent the quotient ( vs R for reminder). Any how, in your first equation (4+7n = r (3))youve made an assumption that R is equal to zero. . ... how did you make that assumption? we dont know the value of R
Will Win
Join the discussion

by palvarez » Wed Nov 18, 2009 1:20 am
hpgmat wrote:
palvarez wrote:
hpgmat wrote:N IS A POSITIVE NUMBER AND R IS THE REMAINDER WHEN 4+7N IS DIVIDED BY 3. WHAT IS THE VALUE OF R?

1) N+1 IS DIVISIBLE BY 3
2)N > 20
Forget about verbal reasoning when you come to this kind of problems. Set up algebraically, using modulus, etc.

4+7n = r (3)

1 + n = r (3)

1. n +1 = 0 (mod 3)
n = 2 (mod 3)
r = n+1 (mod 3) = 3 (mod 3) = 0 Sufficient.

2. n > 20, we need to know n (mod 3). Useless.

A is sufficient.
I believe r in your equations represent the quotient ( vs R for reminder). Any how, in your first equation (4+7n = r (3))youve made an assumption that R is equal to zero. . ... how did you make that assumption?
I din't use the garbage of quotients. Just dont use quotients at all when you are dealing with remainders.

r is a remainder. Just used small letters.

"when 4 + 7n is divided by 3, remainder is r"

Translate that line, algebraically wrt modulus, etc.

4 +7n = r (modulo 3)

1 + n = r (modulo 3), because 4 (modulo 3) =1, 7n(modulo 3) = 7(modulo 3)*n(moduo 3) = 1 (modulo 3) * n (modulo 3) = n (modulo 3)
Join the discussion

by aks.anupam » Wed Nov 18, 2009 2:40 am
Another simple solution can be:

1) N+1 is divisible by 3

i.e. 7N+7 would also be divisible by 3
or, 7N+7 - 3 would also be divisible by 3
or 7N+4 is also divisible by 3
This is what we need to find out: the remainder when 4+7N is divided by 3 : its zero.

Hence SUFFICIENT.

2) N>20. No other information given. Not possible to tell the remainder. Hence INSUFFICIENT.

So the answer is A
Join the discussion

by sreak1089 » Wed Nov 18, 2009 7:19 am
My Approach:

R = (7n + 4) % 3 (% is a C-programming syntax for remainder ;-)

stmt 1: n+1 divisible by 3
=> n+1 = 3k
=> n = 3k -1

Substitute n in eqn for R

R = (7(3k - 1) + 4) % 3
= (21k - 3) % 3
= 3(7k -1) % 3
= 0

Hence stmt 1 is SUFFICIENT.

stmt 2: n > 20

Multiple values possible for R.

Hence stmt 2 is NOT SUFFICIENT.

Hence Ans is A.
Join the discussion

by Willy » Fri Nov 20, 2009 6:50 pm
lets keep this simple...lets not get excited
....what is modulo
aks.anupam wrote:Another simple solution can be:

1) N+1 is divisible by 3

i.e. 7N+7 would also be divisible by 3
or, 7N+7 - 3 would also be divisible by 3
or 7N+4 is also divisible by 3
This is what we need to find out: the remainder when 4+7N is divided by 3 : its zero.

Hence SUFFICIENT.

2) N>20. No other information given. Not possible to tell the remainder. Hence INSUFFICIENT.

So the answer is A
Join the discussion

by geemat » Fri Nov 20, 2009 8:25 pm
Just one doubt: N is given as a positive number but not an integer. How can we assume it to be an integer?
Join the discussion