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 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.
07 Feb 2024, 02:30
Kudos
Bookmarks
C
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!
Difficulty:
25%
(medium)
Question Stats:
80% (01:52) correct
20%
(01:49)
wrong
based on 123
sessions
History
Date
Time
Result
Not Attempted Yet
If m is a positive integer, what is the remainder when m is divided by 20?
(1) When m is divided by 5, the remainder is 3.
(2) When m is divided by 8, the remainder is 3.
(1) When m is divided by 5, the remainder is 3.
(2) When m is divided by 8, the remainder is 3.
07 Feb 2024, 06:40
Kudos
Bookmarks
I think C should be the answer
We are to find the remainder when m is divided by 20.
If we can write m as m=20k+r then r is the remainder when divided by 20.
Statement 1:
When m is divided by 5, the remainder is 3.
So we can write m= 5k+3
| k | m=5k+3 | remainder(m%20) |
|---|---|---|
| 1 | 8 | 8 |
| 2 | 13 | 13 |
| 4 | 23 | 3 |
so we can see that we don't get any conclusive remainder. Insufficient.
Statement 2:
When m is divided by 8, the remainder is 3
We can write m=8k +3
| k | m=8k+3 | remainder(m%20) |
|---|---|---|
| 1 | 11 | 11 |
| 2 | 19 | 19 |
| 3 | 27 | 7 |
Again no conclusive evidence. Insufficient
If we club both the statements together, then
We have m which gives remainder of 3 when divided by both 5 and 8. Now as we know 5 and 8 are co-prime numbers, we can write m in thios case as:
m= (5*8)k+3 = 40k +3
=> m = 2*20k +3
So, m will always produce a remainder of 3 when divided by 20.
| k | m=40k+3 | remainder(m%20) |
|---|---|---|
| 0 | 3 | 3 |
| 1 | 43 | 3 |
| 2 | 83 | 3 |
| 3 | 123 | 3 |
Hence, both of the statements together are sifficient.
Hence, correct option C
03 Jul 2025, 05:26
Kudos
Bookmarks
Automated notice from GMAT Club BumpBot:
A member just gave Kudos to this thread, showing it’s still useful. I’ve bumped it to the top so more people can benefit. Feel free to add your own questions or solutions.
This post was generated automatically.
A member just gave Kudos to this thread, showing it’s still useful. I’ve bumped it to the top so more people can benefit. Feel free to add your own questions or solutions.
This post was generated automatically.
