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.

When a positive integer n is divided by 3, what is the remai

Expert replies
by Max@Math Revolution » Fri Aug 03, 2018 12:49 am

Timer

00:00

Answers

A

B

C

D

E

Stats

Difficulty

[Math Revolution GMAT math practice question]

When a positive integer n is divided by 3, what is the remainder?

1) When n is divided by 5, the remainder is 2
2) When n is divided by 6, the remainder is 2
Join the discussion
Source: — Data Sufficiency |

by Brent@GMATPrepNow » Fri Aug 03, 2018 5:56 am
Max@Math Revolution wrote: When a positive integer n is divided by 3, what is the remainder?
1) When n is divided by 5, the remainder is 2
2) When n is divided by 6, the remainder is 2
Target question: What is the remainder when positive integer n is divided by 3?

Statement 1: When n is divided by 5, the remainder is 2
-----ASIDE---------------------------------------
When it comes to remainders, we have a nice rule that says:
If N divided by D leaves remainder R, then the possible values of N are R, R+D, R+2D, R+3D,. . . etc.
For example, if k divided by 5 leaves a remainder of 1, then the possible values of k are: 1, 1+5, 1+(2)(5), 1+(3)(5), 1+(4)(5), . . . etc.
----------------------------------------------------
So, from the information in statement 1, some possible values of n are: 2, 7, 12, 17, 22, 27, ...
Let's TEST a couple of values:
Case a: If n = 2, then the answer to the target question is the remainder is 2 when n is divided by 3
Case b: If n = 7, then the answer to the target question is the remainder is 1 when n is divided by 3
Since we cannot answer the target question with certainty, statement 1 is NOT SUFFICIENT

Statement 2: When n is divided by 6, the remainder is 2
-----ASIDE---------------------------------------
There's a nice rule that says, "If N divided by D equals Q with remainder R, then N = DQ + R"
For example, since 17 divided by 5 equals 3 with remainder 2, then we can write 17 = (5)(3) + 2
Likewise, since 53 divided by 10 equals 5 with remainder 3, then we can write 53 = (10)(5) + 3
----------------------------------------------------
Let's take statement 2 and rewrite it as follows: When n is divided by 6, the quotient is k and the remainder is 2
From the above rule, we can write: n = 6k + 2
We can rewrite the right side as: n = 3(2k) + 2
We can see that 3(2k) is a multiple of 3
This means 3(2k) + 2 is 2 greater than a multiple of 3
So, when we divide 3(2k) + 2 by 3 the remainder must be 2
This means the answer to the target question is the remainder is 2 when n is divided by 3
Since we can answer the target question with certainty, statement 2 is SUFFICIENT

Answer: B

Cheers,
Brent
Brent Hanneson - Creator of GMATPrepNow.com
Image
Join the discussion

by Max@Math Revolution » Sun Aug 05, 2018 5:51 pm
=>

Forget conventional ways of solving math questions. For DS problems, the VA (Variable Approach) method is the quickest and easiest way to find the answer without actually solving the problem. Remember that equal numbers of variables and independent equations ensure a solution.

The first step of the VA (Variable Approach) method is to modify the original condition and the question. We then recheck the question.

Since the divisor (6) of condition 2) is a multiple of the divisor (3) of the question, condition 2) is sufficient.

When we encounter questions related to remainders, plugging in numbers is suggested.

Condition 1)
If n = 2, then the remainder when n is divided by 3 is 2.
If n = 7, then the remainder when n is divided by 3 is 1.
Since we don't have a unique solution, condition 1) is not sufficient.

Condition 2)
The possible values of n are
n = 2, 8, 14, 20, ...
All of these values have a remainder of 2 when they are divided by 3.
Thus, condition 2) is sufficient.

Therefore, B is the answer.

Answer: B
Join the discussion