Last visit was: 22 Apr 2026, 16:53 It is currently 22 Apr 2026, 16:53
Close
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

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.
Close
Request Expert Reply
Confirm Cancel
User avatar
mithun2vrs
Joined: 21 Feb 2012
Last visit: 21 Aug 2013
Posts: 9
Own Kudos:
11
 [5]
Given Kudos: 3
Posts: 9
Kudos: 11
 [5]
1
Kudos
Add Kudos
4
Bookmarks
Bookmark this Post
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 22 Apr 2026
Posts: 109,754
Own Kudos:
810,668
 [4]
Given Kudos: 105,823
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 109,754
Kudos: 810,668
 [4]
Kudos
Add Kudos
4
Bookmarks
Bookmark this Post
avatar
mamba5
Joined: 10 Aug 2010
Last visit: 07 Aug 2014
Posts: 3
Posts: 3
Kudos: 0
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 22 Apr 2026
Posts: 109,754
Own Kudos:
Given Kudos: 105,823
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 109,754
Kudos: 810,668
Kudos
Add Kudos
Bookmarks
Bookmark this Post
mamba5
Hi Bunuel,

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.

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\).

Hope it's clear.
avatar
MariaS
Joined: 13 Jul 2010
Last visit: 11 Oct 2014
Posts: 9
Own Kudos:
Given Kudos: 25
Posts: 9
Kudos: 3
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Bunuel, Is the following solution valid?

What is the remainder when n is divided by 15?

(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.
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 22 Apr 2026
Posts: 109,754
Own Kudos:
Given Kudos: 105,823
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 109,754
Kudos: 810,668
Kudos
Add Kudos
Bookmarks
Bookmark this Post
MariaS
Bunuel, Is the following solution valid?

What is the remainder when n is divided by 15?

(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.

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.
Thank you for understanding, and happy exploring!
Moderators:
Math Expert
109754 posts
498 posts
212 posts