Last visit was: 25 Apr 2024, 22:54 It is currently 25 Apr 2024, 22:54

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
SORT BY:
Date
Math Expert
Joined: 02 Sep 2009
Posts: 92915
Own Kudos [?]: 619067 [24]
Given Kudos: 81595
Send PM
Most Helpful Reply
User avatar
Retired Moderator
Joined: 06 Jul 2014
Posts: 1010
Own Kudos [?]: 6341 [7]
Given Kudos: 178
Location: Ukraine
Concentration: Entrepreneurship, Technology
GMAT 1: 660 Q48 V33
GMAT 2: 740 Q50 V40
Send PM
General Discussion
User avatar
Senior Manager
Senior Manager
Joined: 07 Aug 2011
Posts: 425
Own Kudos [?]: 1751 [1]
Given Kudos: 75
Concentration: International Business, Technology
GMAT 1: 630 Q49 V27
Send PM
Retired Moderator
Joined: 02 Apr 2014
Status:I Declare War!!!
Posts: 218
Own Kudos [?]: 122 [1]
Given Kudos: 546
Location: United States
Concentration: Finance, Economics
GMAT Date: 03-18-2015
WE:Asset Management (Investment Banking)
Send PM
Re: In an integer division operation, the divisor is x, the quotient is y, [#permalink]
1
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: 92915
Own Kudos [?]: 619067 [2]
Given Kudos: 81595
Send PM
Re: In an integer division operation, the divisor is x, the quotient is y, [#permalink]
2
Bookmarks
Expert Reply
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.
Intern
Intern
Joined: 16 Feb 2016
Posts: 41
Own Kudos [?]: 42 [0]
Given Kudos: 26
Concentration: Other, Other
Send PM
Re: In an integer division operation, the divisor is x, the quotient is y, [#permalink]
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
Current Student
Joined: 23 Apr 2018
Posts: 130
Own Kudos [?]: 63 [0]
Given Kudos: 176
Send PM
In an integer division operation, the divisor is x, the quotient is y, [#permalink]
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.


Bunuel , can you help me out with my confusion here, i read that Y is the quotient, and X is the divisor..
Why x has to be greater than y ? as We can also divide 140 by 7 i.e X and in that case quotient i.e Y would be 20.
Please correct me if i am missing out on some information, but it's causing me a lot of confusion here.
How's X > Y here ?
Math Expert
Joined: 02 Sep 2009
Posts: 92915
Own Kudos [?]: 619067 [1]
Given Kudos: 81595
Send PM
Re: In an integer division operation, the divisor is x, the quotient is y, [#permalink]
1
Kudos
Expert Reply
Shrey9 wrote:
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.


Bunuel , can you help me out with my confusion here, i read that Y is the quotient, and X is the divisor..
Why x has to be greater than y ? as We can also divide 140 by 7 i.e X and in that case quotient i.e Y would be 20.
Please correct me if i am missing out on some information, but it's causing me a lot of confusion here.
How's X > Y here ?


If \(x\) and \(y\) are positive integers, there exist unique integers \(q\) and \(r\), called the quotient and remainder, respectively, such that \(y =divisor*quotient+remainder= xq + r\) and \(0\leq{r}<x\).

For example, when 15 is divided by 6, the quotient is 2 and the remainder is 3 since \(15 = 6*2 + 3\).

Notice that \(0\leq{r}<x\) means that remainder is a non-negative integer and always less than divisor.

It's easier to understand if you consider a simple example: when you divide by 3, the remainder could only be 0, 1, or 2.

For more on this please check the links below:

6. Remainders


Intern
Intern
Joined: 25 Jun 2017
Posts: 28
Own Kudos [?]: 30 [0]
Given Kudos: 49
Location: Canada
GMAT 1: 660 Q45 V36
GPA: 3.5
WE:Human Resources (Consumer Products)
Send PM
Re: In an integer division operation, the divisor is x, the quotient is y, [#permalink]
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.




How come x can't equal 70 and y equal 2? The remainder would be 11 is this case as well.
Intern
Intern
Joined: 14 Jun 2020
Status:Consultant
Posts: 45
Own Kudos [?]: 17 [0]
Given Kudos: 54
Send PM
Re: In an integer division operation, the divisor is x, the quotient is y, [#permalink]
But isn't this true that z is a prime number i.e. 151, therefore x has to be greater than y? Thus making A sufficient?

Same with B: any number has x > y until it is a perfect square , in which case it is equal. By telling remainder 11, the question clearly tells that the number is not a perfect square, thus making condition 2 also sufficient?

Thus D is correct?
User avatar
Non-Human User
Joined: 09 Sep 2013
Posts: 32680
Own Kudos [?]: 822 [0]
Given Kudos: 0
Send PM
Re: In an integer division operation, the divisor is x, the quotient is y, [#permalink]
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 Club Bot
Re: In an integer division operation, the divisor is x, the quotient is y, [#permalink]
Moderator:
Math Expert
92915 posts

Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne