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
we will pick new questions that match your level based on your Timer History
Track Your Progress
every week, we’ll send you an estimated GMAT score based on your performance
Practice Pays
we will pick new questions that match your level based on your Timer History
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:
Struggling with GMAT Verbal as a non-native speaker? Harsh improved his score from 595 to 695 in just 45 days—and scored a 99 %ile in Verbal (V88)! Learn how smart strategy, clarity, and guided prep helped him gain 100 points.
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.
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!
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
(1) When n is divided by 5 the remainder is 4 (2) When n is divided by 6 the remainder is 5.
What is the best way to solve such probs or rather what is the sufficient condition to say that a remainder can conclusively determined. Any thots on this pls.
Show more
GMAT wording would be:
If n is a positive integer, what is the remainder when n is divided by 15?
(1) When n is divided by 5 the remainder is 4 --> \(n=5q+4\), so \(n\) can be: 4, 9, 14, 19, 24, 29, ... Not sufficient to get the single numerical value of the remainder.
(2) When n is divided by 6 the remainder is 5 --> \(n=6p+5\), so \(n\) can be: 5, 11, 17, 23, 29, ... Not sufficient to get the single numerical value of the remainder.
For these types of questions...how can a possibly integer for X be the remainder itself?
I.e. From Manhattan's book they say "When positive integer X is divided by 5, the remainder is 2"
The possibilities they list for X are 2, 7, 12, 17.
I don't see how 2 is a possibility.
I am seeing this happen on similar questions so I think I'm missing a fundamental rule or something.
Show more
THEORY: Positive integer \(a\) divided by positive integer \(d\) yields a reminder of \(r\) can always be expressed as \(a=qd+r\), where \(q\) is called a quotient and \(r\) is called a remainder, note here that \(0\leq{r}<d\) (remainder is non-negative integer and always less than divisor).
For example positive integer n is divided by 25 yields the remainder of 13 can be expressed as: \(n=25q+13\). Now, the lowest value of \(q\) can be zero and in this case \(n=13\) --> 13 divided by 25 yields the remainder of 13. Generally when divisor (25 in our case) is more than dividend (13 in our case) then the reminder equals to the dividend. For example: 3 divided by 24 yields a reminder of 3 --> \(3=0*24+3\); or: 5 divided by 6 yields a reminder of 5 --> \(5=0*6+5\), or example from your post: 2 divided by 5 yields a reminder of 2 --> \(2=0*5+2\).
(1) When n is divided by 5 the remainder is 4 (2) When n is divided by 6 the remainder is 5.
Clearly, both statements are insufficient separately, but taken together, we know that when n is divided by 30 (5*6) the remainder is 20 (4*5) --> in other words, when n is divided by 15. the remainder is 10.
(1) When n is divided by 5 the remainder is 4 (2) When n is divided by 6 the remainder is 5.
Clearly, both statements are insufficient separately, but taken together, we know that when n is divided by 30 (5*6) the remainder is 20 (4*5) --> in other words, when n is divided by 15. the remainder is 10.
Show more
No, that's not correct. If you refer to the solution above you'll see that when we combine two statements formula for \(n\) becomes \(n=30t+29\), so when \(n\) is divided by 30 the remainder is 29, not 20 (\(n\) could be 29, 59, 89, 119, ...). From there: \(n=30t+29=30t+15+14=15(2t+1)+14\), hence the remainder upon division of \(n\) by 15 is 14, not 10. Complete solution here: what-is-the-remainder-when-n-is-divided-by-131442.html#p1079249 Also please follow the links provided in that post to see similar questions with explanations.
Finally, even if we had that when \(n\) is divided by 30 the remainder is 20 (\(n=30q+20\)) still your conclusion would be wrong: \(n=30q+20=30q+15+5=15(2q+1)+5\), hence in this case the remainder upon division of \(n\) by 15 would be 5, not 10.
Hope it's clear.
This Question is Locked Due to Poor Quality
Hi there,
The question you've reached has been archived due to not meeting our community quality standards. No more replies are possible here.
Looking for better-quality questions? Check out the 'Similar Questions' block below
for a list of similar but high-quality questions.
Want to join other relevant Problem Solving discussions? Visit our Data Sufficiency (DS) Forum
for the most recent and top-quality discussions.