Last visit was: 19 Nov 2025, 14:58 It is currently 19 Nov 2025, 14:58
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
duttsit
Joined: 22 Aug 2005
Last visit: 19 Feb 2016
Posts: 494
Own Kudos:
Location: CA
Posts: 494
Kudos: 700
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
kevincan
User avatar
GMAT Instructor
Joined: 04 Jul 2006
Last visit: 18 Apr 2022
Posts: 958
Own Kudos:
Given Kudos: 6
Location: Madrid
Posts: 958
Kudos: 729
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
haas_mba07
Joined: 02 Jun 2006
Last visit: 26 Jun 2008
Posts: 662
Own Kudos:
Posts: 662
Kudos: 216
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
gmatornot
Joined: 14 Jul 2005
Last visit: 15 Apr 2007
Posts: 237
Own Kudos:
Posts: 237
Kudos: 361
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Got C

Given k>j>0

ST1 k = jm+5

Hence k/j =m + 5/j (j can be any value > 0) Hence NOT SUFF

ST2 = j>5

By itself statement 2 is INSUFF

Comnbining the two statements, from 1 k/j = m + 5/j

Hence if j >5 the remainder is always 5 i.e. 5/6 5/10 etc...
User avatar
duttsit
Joined: 22 Aug 2005
Last visit: 19 Feb 2016
Posts: 494
Own Kudos:
Location: CA
Posts: 494
Kudos: 700
Kudos
Add Kudos
Bookmarks
Bookmark this Post
C me 2. You guys nailed it.
Have to wait till Moday, though, for OA/OE.
User avatar
yezz
User avatar
Retired Moderator
Joined: 05 Jul 2006
Last visit: 26 Apr 2022
Posts: 833
Own Kudos:
Given Kudos: 49
Posts: 833
Kudos: 1,661
Kudos
Add Kudos
Bookmarks
Bookmark this Post
If j and k are positive integers where k > j, what is the value of the remainder when k is divided by j?

(1) There exists a positive integer m such that k = jm + 5.

(2) j > 5


by definition of a remainder.

if x.y and x is not devisible by y not = zero ,there exist an intiger q( qoutient)

such that x/y = qy+r
where 0 < r < y

so WITHOUT KNOWING THE RELATION BETWEEN y and r we can never assume that 5 is a remainder in the above question.

So c must be the answer.
User avatar
duttsit
Joined: 22 Aug 2005
Last visit: 19 Feb 2016
Posts: 494
Own Kudos:
Location: CA
Posts: 494
Kudos: 700
Kudos
Add Kudos
Bookmarks
Bookmark this Post
OA C.
(1) INSUFFICIENT: At first glance, this may seem sufficient since if 5 is the remainder when k is divided by j, then there will always exist a positive integer m such that k = jm + 5. In this case, m is equal to the integer quotient and 5 is the remainder. For example, if k = 13 and j = 8, and 13 divided by 8 has remainder 5, it must follow that there exists an m such that k = jm + 5: m = 1 and 13 = (8)(1) + 5.

However, the logic does not go the other way: 5 is not necessarily the remainder when k is divided by j. For example, if k = 13 and j = 2, there exists an m (m = 4) such that k = jm + 5: 13 = (2)(4) + 5, consistent with statement (1), yet 13 divided by 2 has remainder 1 rather than 5.

When j < 5 (e.g., 2 < 5); this means that j can go into 5 (e.g., 2 can go into 5) at least one more time, and consequently m is not the true quotient of k divided by j and 5 is not the true remainder. Similarly, if we let k = 14 and j = 3, there exists an m (e.g., m = 3) such that statement (1) is also satisfied [i.e., 14 = (3)(3) + 5], yet the remainder when 14 is divided by 3 is 2, a different result than the first example.

Statement (1) tells us that k = jm + 5, where m is a positive integer. That means that k/j = m + 5/j = integer + 5/j. Thus, the remainder when k is divided by j is either 5 (when j > 5), or equal to the remainder of 5/j (when j is 5 or less). Since we do not know whether j is greater than or less than 5, we cannot determine the remainder when k is divided by j.

(2) INSUFFICIENT: This only gives the range of possible values of j and by itself does not give any insight as to the value of the remainder when k is divided by j.

(1) AND (2) SUFFICIENT: Statement (1) was not sufficient because we were not given whether 5 > j, so we could not be sure whether j could go into 5 (or k) any additional times. However, (2) tells us that j > 5, so we now know that j cannot go into 5 any more times. This means that m is the exact number of times that k can be divided by j and that 5 is the true remainder.

Another way of putting this is: From statement (1) we know that k/j = m + 5/j = integer + 5/j. From statement (2) we know that j > 5. Therefore, the remainder when k is divided by j must always be 5.

The correct answer is C.
User avatar
kevincan
User avatar
GMAT Instructor
Joined: 04 Jul 2006
Last visit: 18 Apr 2022
Posts: 958
Own Kudos:
Given Kudos: 6
Location: Madrid
Posts: 958
Kudos: 729
Kudos
Add Kudos
Bookmarks
Bookmark this Post
What a nice (though long) explanation!



Archived Topic
Hi there,
This topic has been closed and archived due to inactivity or violation of community quality standards. No more replies are possible here.
Where to now? Join ongoing discussions on thousands of quality questions in our Data Sufficiency (DS) Forum
Still interested in this question? Check out the "Best Topics" block above for a better discussion on this exact question, as well as several more related questions.
Thank you for understanding, and happy exploring!
Moderators:
Math Expert
105390 posts
GMAT Tutor
1924 posts