|
Author |
Message |
|
TAGS:
|
|
|
Math Expert
Joined: 02 Sep 2009
Posts: 44609
|
In an integer division operation, the divisor is x, the quotient is y, [#permalink]
Show Tags
 22 Apr 2015, 03:08
1
This post received
KUDOS
Expert's post
5
This post was
BOOKMARKED
D
E
Question Stats:
53% (01:36) correct 47% (01:21) wrong based on 187 sessions
HideShow timer Statistics
|
|
|
|
|
|
Retired Moderator
Joined: 06 Jul 2014
Posts: 1266
Location: Ukraine
Concentration: Entrepreneurship, Technology
GMAT 1: 660 Q48 V33 GMAT 2: 740 Q50 V40
|
In an integer division operation, the divisor is x, the quotient is y, [#permalink]
Show Tags
22 Apr 2015, 03:30
3
This post received
KUDOS
4
This post was
BOOKMARKED
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
_________________
Simple way to always control time during the quant part.
How to solve main idea questions without full understanding of RC.
660 (Q48, V33) - unpleasant surprise
740 (Q50, V40, IR3) - anti-debrief 
|
|
|
|
|
|
Director
Joined: 07 Aug 2011
Posts: 568
Concentration: International Business, Technology
|
Re: In an integer division operation, the divisor is x, the quotient is y, [#permalink]
Show Tags
22 Apr 2015, 20:30
1
This post received
KUDOS
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. z=xy+r (1) z = 151 Insufficient. (2) r = 11 Insufficient. x*y= 140 x>11 so minimum 'x' is 14 and maximum 'y' is '10' . Answer C .
_________________
Thanks,
Lucky
_______________________________________________________
Kindly press the  to appreciate my post !! 
|
|
|
|
|
|
Retired Moderator
Status: I Declare War!!!
Joined: 02 Apr 2014
Posts: 243
Location: United States
Concentration: Finance, Economics
GMAT Date: 03-18-2015
WE: Asset Management (Investment Banking)
|
Re: In an integer division operation, the divisor is x, the quotient is y, [#permalink]
Show Tags
24 Apr 2015, 07:31
1
This post received
KUDOS
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?
(1) z = 151
(2) r = 11
Kudos for a correct solution.
|
|
|
|
|
|
Math Expert
Joined: 02 Sep 2009
Posts: 44609
|
Re: In an integer division operation, the divisor is x, the quotient is y, [#permalink]
Show Tags
27 Apr 2015, 03:10
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. VERITAS PREP OFFICIAL SOLUTION: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.
_________________
New to the Math Forum?
Please read this: Ultimate GMAT Quantitative Megathread | All You Need for Quant | PLEASE READ AND FOLLOW: 12 Rules for Posting!!!
Resources:
GMAT Math Book | Triangles | Polygons | Coordinate Geometry | Factorials | Circles | Number Theory | Remainders; 8. Overlapping Sets | PDF of Math Book; 10. Remainders | GMAT Prep Software Analysis | SEVEN SAMURAI OF 2012 (BEST DISCUSSIONS) | Tricky questions from previous years.
Collection of Questions:
PS: 1. Tough and Tricky questions; 2. Hard questions; 3. Hard questions part 2; 4. Standard deviation; 5. Tough Problem Solving Questions With Solutions; 6. Probability and Combinations Questions With Solutions; 7 Tough and tricky exponents and roots questions; 8 12 Easy Pieces (or not?); 9 Bakers' Dozen; 10 Algebra set. ,11 Mixed Questions, 12 Fresh Meat
DS: 1. DS tough questions; 2. DS tough questions part 2; 3. DS tough questions part 3; 4. DS Standard deviation; 5. Inequalities; 6. 700+ GMAT Data Sufficiency Questions With Explanations; 7 Tough and tricky exponents and roots questions; 8 The Discreet Charm of the DS; 9 Devil's Dozen!!!; 10 Number Properties set., 11 New DS set.
What are GMAT Club Tests?
Extra-hard Quant Tests with Brilliant Analytics
|
|
|
|
|
|
Manager
Joined: 16 Feb 2016
Posts: 53
Concentration: Other, Other
|
Re: In an integer division operation, the divisor is x, the quotient is y, [#permalink]
Show Tags
26 Apr 2016, 07:25
Bunuel wrote: 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. VERITAS PREP OFFICIAL SOLUTION: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
|
|
|
|
|
|
Manager
Joined: 23 Sep 2016
Posts: 96
|
In an integer division operation, the divisor is x, the quotient is... [#permalink]
Show Tags
29 Oct 2016, 13:55
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
|
|
|
|
|
|
Math Expert
Joined: 02 Sep 2009
Posts: 44609
|
Re: In an integer division operation, the divisor is x, the quotient is y, [#permalink]
Show Tags
29 Oct 2016, 14:24
|
|
|
|
|
|
Non-Human User
Joined: 09 Sep 2013
Posts: 6655
|
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.
_________________
GMAT Books | GMAT Club Tests | Best Prices on GMAT Courses | GMAT Mobile App | Math Resources | Verbal Resources
|
|
|
|
|
|
|
Re: In an integer division operation, the divisor is x, the quotient is y,
[#permalink]
13 Apr 2018, 06:10
|
|
|
|
|
|
|
|
|
|
|
close
