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:
In an integer division operation, the divisor is x, the quotient is y,
[#permalink]
Show Tags
22 Apr 2015, 03:30
3
4
Bunuel wrote:
In an integer division operation, the divisor is x, the quotient is y, the dividend is z, and remainder is r. Is x > y?
(1) z = 151
(2) r = 11
Kudos for a correct solution.
We can write this task in such way: \(z = x*y + r\)
1) we know only \(z\) and this is insufficient. 2) we know only \(r\) and this is insufficient
1+2) \(151 = x*y + 11\) This is looks like insufficient, but we know that \(x\) and \(y\) should be integer and remainder should be less than divisor: \(x>11\). And from this information we can infer that \(x*y = 151-11 = 140\) and as \(x\) should be more than 11, the least possible number is 14 and \(y\) should be equal to 10 So \(x > y\) and answer is C
_________________
Re: In an integer division operation, the divisor is x, the quotient is y,
[#permalink]
Show Tags
24 Apr 2015, 07:31
1
Hi, IMO it should be C. that is after combining both statements. St 1) just be talking about z-151 nothing comes out. 151/2 or 151/150. so remainder being same still x and y cant be quantified.
st 2) r = 11. still nothing comes out
combining both: find the number which when divides 151 leaves remainder of 11 x should be 14 and y be 10.
Though while solving I assigned x as 140 / 28 too.. which leaves remainder of 11 when divided by 151 hence C Regards Celestial
Kudos if its a correct solution
Bunuel wrote:
In an integer division operation, the divisor is x, the quotient is y, the dividend is z, and remainder is r. Is x > y?
Quick hypothetical situations should prove statement 1 to be insufficient. If x is 151, then you'd be dividing the same thing by itself and y would be 1 with no remainder, and x would be much larger than y. But you could flip that and make x = 1, in which you'd just be dividing 151 by 1 and the quotient (y) would be 151, much larger than x.
Recognizing the algebra of division can be quite helpful here, too. Since Quotient = Dividend * Divisor + Remainder, just knowing statement 1 tells you that 151 = xy + r, and clearly that's not enough information to solve.
Statement 2 is also insufficient. Keep in mind here that, without knowing statement 1, you essentially just have an undefined problem with a remainder of 11. Algebraically that's:
z = xy + 11
And clearly not enough information to solve.
But taken together, the information is sufficient. Why, if it still leaves two variables?
151 = xy + 11, so:
140 = xy
The other crucial element of this being a division problem is that the divisor can't be less than the remainder! If you're dividing 151 by, say, 7, you'd never have 11 left over. Even though 7 * 20 = 140, you wouldn't stop there and say that the remainder is 11, because 11 can still divide one more time by 7 (making it 21, remainder 4). So since 140 = xy AND x > 11, there's no way for an integer y to be greater than x. Therefore the two statements together are sufficient.
_________________
Quick hypothetical situations should prove statement 1 to be insufficient. If x is 151, then you'd be dividing the same thing by itself and y would be 1 with no remainder, and x would be much larger than y. But you could flip that and make x = 1, in which you'd just be dividing 151 by 1 and the quotient (y) would be 151, much larger than x.
Recognizing the algebra of division can be quite helpful here, too. Since Quotient = Dividend * Divisor + Remainder, just knowing statement 1 tells you that 151 = xy + r, and clearly that's not enough information to solve.
Statement 2 is also insufficient. Keep in mind here that, without knowing statement 1, you essentially just have an undefined problem with a remainder of 11. Algebraically that's:
z = xy + 11
And clearly not enough information to solve.
But taken together, the information is sufficient. Why, if it still leaves two variables?
151 = xy + 11, so:
140 = xy
The other crucial element of this being a division problem is that the divisor can't be less than the remainder! If you're dividing 151 by, say, 7, you'd never have 11 left over. Even though 7 * 20 = 140, you wouldn't stop there and say that the remainder is 11, because 11 can still divide one more time by 7 (making it 21, remainder 4). So since 140 = xy AND x > 11, there's no way for an integer y to be greater than x. Therefore the two statements together are sufficient.
Typo: Should be Dividend=Divisor*Quotient + Remainder
Re: In an integer division operation, the divisor is x, the quotient is y,
[#permalink]
Show Tags
13 Apr 2018, 06:10
Hello from the GMAT Club BumpBot!
Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).
Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.
_________________
close
55% (02:15) correct 
to appreciate my post !! 
