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.
Apr 2512:30 AM EDT
-01:30 AM EDT
At one point, she believed GMAT wasn’t for her. After scoring 595, self-doubt crept in and she questioned her potential. But instead of quitting, she made the right strategic changes. The result? A remarkable comeback to 695. Check out how Saakshi did it.
Apr 2610:00 AM EDT
-11:00 AM EDT
The Target Test Prep course represents a quantum leap forward in GMAT preparation, a radical reinterpretation of the way that students should study. Try before you buy with a 5-day, full-access trial of the course for FREE!
Apr 2711:00 AM EDT
-12:00 PM EDT
Prefer video-based learning? The Target Test Prep OnDemand course is a one-of-a-kind video masterclass featuring 400 hours of lecture-style teaching by Scott Woodbury-Stewart, founder of Target Test Prep and one of the most accomplished GMAT instructors
Apr 2808:00 AM PDT
-11:00 AM PDT
Whether you are just beginning your MBA journey or fine-tuning your path to a 700+ score, GMAT Day is designed to give you a competitive edge.
26 Apr 2019, 02:28
Kudos
Bookmarks
A
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!
Difficulty:
5%
(low)
Question Stats:
90% (01:07) correct
10%
(01:17)
wrong
based on 1775
sessions
History
Date
Time
Result
Not Attempted Yet
What is the remainder when the positive integer n is divided by 5 ?
(1) When n is divided by 3, the quotient is 4 and the remainder is 1.
(2) When n is divided by 4, the remainder is 1.
DS07502.01
OG2020 NEW QUESTION
(1) When n is divided by 3, the quotient is 4 and the remainder is 1.
(2) When n is divided by 4, the remainder is 1.
DS07502.01
OG2020 NEW QUESTION
30 Apr 2019, 08:10
Kudos
Bookmarks
Quote:
This question primarily hinges on our understanding of the relationship between dividend, divisor, quotient, and remainder. If we can either solve for n, or solve for the units digit of n, we will have sufficiency (as divisibility by 5 depends entirely on the units digit). Now we're ready to take a look at our statements!
Statement (1) tells us that "When n is divided by 3, the quotient is 4 and the remainder is 1." If we set this up mathematically using our understanding that the dividend = (divisor)*(quotient) + remainder, we can solve for "n," as n = 3*4 + 1, or 13. If we know "n," we certainly know the remainder when we divide "n" by 5 - in this case, 3. (Sufficient)
With Statement (2), we know that n/4 gives us a remainder of 1, so we know that n = "some multiple of 4, plus 1." However, we can quickly disprove sufficiency, as we could have 4+1 = 5, giving us a remainder of 0, or 8+1 = 9, giving us a remainder of 4. As soon as we can pick permissible values that give us different values for this value Data Sufficiency quesiton, we have disproven sufficiency. (Not Sufficient)
In this case, taking a moment to preempt what we need to have sufficiency, and recognizing that if we're given enough information to solve for "n," we have sufficiency, and that if we are able to quickly choose permissible values for "n" that give us different answers to our value DS question, we can efficiently disprove sufficiency, we are left with (A).
General Discussion
26 Apr 2019, 04:28
Kudos
Bookmarks
From S1:
n = 3*4+1
n = 13
Sufficient.
When 13 is divided by 5, the remainder is 3.
From S2:
n/4 = 1
n can be 1, 5, 9....
Insufficient.
A is the answer.
n = 3*4+1
n = 13
Sufficient.
When 13 is divided by 5, the remainder is 3.
From S2:
n/4 = 1
n can be 1, 5, 9....
Insufficient.
A is the answer.
