BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course
Redeem
Featured Course
Scott Woodbury-Stewart’s private virtual classroom — 400 hours of master-class video lessons for the GMAT Focus Edition.
If x is divided by y (x and y are both positive integers), then x = qy + r, where q is the quotient and r is the remainder (0 <= r < y which means remainder is always less than divisor).gmatblood wrote: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
Please help me understand statement 1. I am missing some thing here.Anurag@Gurome wrote:If x is divided by y (x and y are both positive integers), then x = qy + r, where q is the quotient and r is the remainder (0 <= r < y which means remainder is always less than divisor).gmatblood wrote: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
In this question, k is divided by j implies k = qj + r, so we have to find r.
(1) k = jm + 5, where m is a positive integer. Here we do not know if 5 < j or not, as the remainder must be less than divisor; NOT sufficient.
(2) j > 5 is again NOT sufficient.
Combining (1) and (2), k = jm + 5 and j > 5, which implies r = 5; SUFFICIENT.
The correct answer is C.
Does it?PGMAT wrote:How can j be less than 5 here? For example, j=2, then remainder is either 0 or 1. But stmt 1 clearly says remainder is 5. So, shouldn't this statement be sufficient by itself?
New here Create free account
