Forum Home > GMAT > Quantitative > Problem Solving (PS)
Events & Promotions
GMAT Club Daily Prep
Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.
Customized
for You
Track
Your Progress
Practice
Pays
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Sep 0810:00 AM PDT
-11:00 AM PDT
Paid vs Free GMAT Resources: "What's Best for You?" This concise guide breaks down the pros and cons of both free and paid study materials, helping you make an informed decision for your GMAT journey.
Sep 0811:30 AM EDT
-01:30 PM EDT
Struggling to find the right strategies to score a 99 %ile on GMAT Focus? Riya (GMAT 715) boosted her score by 100-points in just 15 days! Discover how the right mentorship, tailored strategies, and an unwavering mindset can transform your GMAT prep.
Sep 1211:00 AM EDT
-12:00 PM EDT
Have you ever wondered how to score a PERFECT 805 on the GMAT? Meet Julia, a banking professional who used the Target Test Prep course to achieve this incredible feat. Julia's story is nothing short of an inspiration.
Sep 1310:00 AM EDT
-11:00 AM EDT
More and more TTP students are earning impressive scores on the GMAT. Now is the perfect time to join the many GMAT students who made the switch to TTP and surpassed their wildest expectations on test day.
Sep 1308:00 PM PDT
-09:00 PM PDT
Full-length FE mock with insightful analytics, weakness diagnosis, and video explanations!
Sep 1411:00 AM IST
-01:00 PM IST
Text – Do RC/MSR passages scare you? e-GMAT is conducting a masterclass to help you learn – Learn effective reading strategies, Tackle difficult RC & MSR with confidence, Excel in timed test environment
Math Revolution GMAT Instructor
Joined: 16 Aug 2015
Posts: 10131
Given Kudos: 4
GMAT 1: 760 Q51 V42
GPA: 3.82
When a positive integer n is divided by 3, what is the remainder?
[#permalink]
03 Aug 2018, 02:06
03 Aug 2018, 02:06
8
Bookmarks
Expert Reply
Show timer
00:00
A
B
C
D
E
Difficulty:
15%
(low)
Question Stats:
81% (01:09) correct
19%
(01:32)
wrong
based on 172
sessions
[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
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
GMAT Club Legend
Joined: 12 Sep 2015
Posts: 6804
Given Kudos: 799
Location: Canada
Re: When a positive integer n is divided by 3, what is the remainder?
[#permalink]
03 Aug 2018, 07:04
03 Aug 2018, 07:04
2
Bookmarks
Expert Reply
Top Contributor
MathRevolution wrote:
[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
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
RELATED VIDEO FROM OUR COURSE
Math Revolution GMAT Instructor
Joined: 16 Aug 2015
Posts: 10131
Given Kudos: 4
GMAT 1: 760 Q51 V42
GPA: 3.82
Re: When a positive integer n is divided by 3, what is the remainder?
[#permalink]
05 Aug 2018, 19:04
05 Aug 2018, 19:04
Expert Reply
=>
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
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
