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.

It appears that you are browsing the GMAT Club forum unregistered!

Signing up is free, quick, and confidential.
Join other 500,000 members and get the full benefits of GMAT Club

Registration gives you:

Tests

Take 11 tests and quizzes from GMAT Club and leading GMAT prep companies such as Manhattan GMAT,
Knewton, and others. All are free for GMAT Club members.

Applicant Stats

View detailed applicant stats such as GPA, GMAT score, work experience, location, application
status, and more

Books/Downloads

Download thousands of study notes,
question collections, GMAT Club’s
Grammar and Math books.
All are free!

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:

If a and b are integers, and |a| > |b|, is a·|b| < a – b? 1. a < 0 2. ab >= 0

I managed to solve this by taking values for a and b that were both positive and negative. I managed to get the correct answer based on this approach but it took me almost 4 minutes, roughly 2 mins to solve for each of the clues. Is there any faster way to solve this?

I think this is a 700+ question.

1. a < 0 .... a is -ve |b| is always +ve so a.|b| is always negative also |a|>|b| so even if b is +ve (a-b) will always be -ve. But a.|b| will always give a much smaller value than a-b.

So suff.

2. ab >= 0 .

here a and b will always have the same sign unless and until one of them is 0.

so if we have a and b both to be -ve, our problem boils down to the one in case 1. i.e. the equation holds good.

But consider a = 0, and b to be +ve and we see that it contradicts our previous result.

If a and b are integers, and |a| > |b|, is a·|b| < a – b? 1. a < 0 2. ab >= 0

The key to solve this problem is to determine the relationship between the signs of a-b and a·|b|, with the given condition that |a|>|b|. When determined the rest of problem will go smoothly.

So, NOTE that when |a|>|b|:

a-b>0 IF and ONLY a>0, no matter what possible values will take b (possible means not violating the given condition |a|>|b|)

a-b<0 IF and ONLY a<0, no matter what possible values will take b (possible means not violating the given condition |a|>|b|)

Above conclusion means that: when a>0 --> a·|b|>0 and a – b>0 AND when a<0 --> a·|b|<0 and a – b<0

Also NOTE that even knowing the signs of LHS and RHS of our inequality its not possible to determine LHS<RHS or not.

Generally speaking even not considering the statements, we can conclude, that if they are giving us ONLY the info about the signs of a and b, it won't help us to answer the Q. (in our case we can even not consider them separately or together, we know answer would be E, as the statements are only about the signs of the variables)

But still let's look at the statement:

(1) a<0 --> a|b|<0 (a negative |b| positive) and we already determined that when a<0 a-b<0 --> so both are negative but we can not determine is a · |b| < a – b or not. Not Sufficient

(2) ab >= 0 a>0 b=>0 (a can not be zero as |a|>|b|) or a<0, b<=0

a>0 b=>0 --> a|b|>0 and a – b>0 --> both are positive but we can not determine is a · |b| < a – b or not. a<0, b<=0 --> a|b|<0 and a-b<0 --> both are negative but we can not determine is a · |b| < a – b or not. Not Sufficient

(1)+(2) --> a<0, b<0 same thing --> a|b|<0 and a-b<0 we can not determine is a · |b| < a – b or not.

If a and b are integers, and |a| > |b|, is a·|b| < a – b?

1. a < 0 2. ab >= 0

I managed to solve this by taking values for a and b that were both positive and negative. I managed to get the correct answer based on this approach but it took me almost 4 minutes, roughly 2 mins to solve for each of the clues. Is there any faster way to solve this?

I think this is a 700+ question.

1. If a < 0, b could be -ve or 0 or +ve. If b = -ve, (a·|b|) and (a – b) both are -ve however the relationship between (a·|b|) and (a – b) cannot be established. If b = 0, (a·|b|) = 0 but (a – b) is still -ve. so (a·|b|) < (a – b) is not true. If b = +ve, (a·|b|) and (a – b) bot hare -ve however the relationship between (a·|b|) and (a – b) cannot be established. NSF...

2. If ab >= 0, a and b could be both -ve or +ve or 0 or only one of either is 0 and the other is non-zero. The relationship between (a·|b|) and (a – b) cannot be established here too. NSF...

Togather also the relationship between (a·|b|) and (a – b) cannot be established. NSF...... Thats E. _________________

Condtion 2 does not bind anything, if B equals 0 or less than 1 and if B equals a large number with A being a bigger abs valued negative number it does not prove sufficient.

Re: If a and b are integers, and |a| > |b|, is a |b| < a [#permalink]

Show Tags

17 Jan 2013, 00:18

1

This post received KUDOS

yangsta8 wrote:

If a and b are integers, and |a| > |b|, is a·|b| < a – b? 1. a < 0 2. ab >= 0

I noticed that these kinds of questions are important on the GMAT... I've seen many of these types that initially threw me off until I faced this type and practiced as much...

My solution: 1. Test a is (-) and b is (-) : -2|-1| < -2 + 1 ==> -2 < -1 YES! Test a is (-) and b is (+): -2 |1| < -2 - 1 ==> -2 < -3 NO! We stop here since we know that the information is INSUFFICIENT.

2. The info meant a and b must have the same sign or one of them is 0. Test a is (-) and b is (-): From Statement 1 we know this is YES! Test a is (+) and b is (+): 2|1| < 2 - 1 ==> 2 < 1 NO! We stop here and we know that the information is INSUFFICIENT.

Together: We know a is (-) and be is either (-) or (0) Test a is (-) and b is (-): From Statement 1 we know this is YES! Test a is (-) and b is 0: 0 < -2 NO! Still information together is INSUFFICIENT!

Re: If a and b are integers, and |a| > |b|, is a |b| < a [#permalink]

Show Tags

21 Jan 2013, 16:48

mbaiseasy wrote:

yangsta8 wrote:

If a and b are integers, and |a| > |b|, is a·|b| < a – b? 1. a < 0 2. ab >= 0

I noticed that these kinds of questions are important on the GMAT... I've seen many of these types that initially threw me off until I faced this type and practiced as much...

My solution: 1. Test a is (-) and b is (-) : -2|-1| < -2 + 1 ==> -2 < -1 YES! Test a is (-) and b is (+): -2 |1| < -2 - 1 ==> -2 < -3 NO! We stop here since we know that the information is INSUFFICIENT.

2. The info meant a and b must have the same sign or one of them is 0. Test a is (-) and b is (-): From Statement 1 we know this is YES! Test a is (+) and b is (+): 2|1| < 2 - 1 ==> 2 < 1 NO! We stop here and we know that the information is INSUFFICIENT.

Together: We know a is (-) and be is either (-) or (0) Test a is (-) and b is (-): From Statement 1 we know this is YES! Test a is (-) and b is 0: 0 < -2 NO! Still information together is INSUFFICIENT!

Answer: E

This is the type of question that I have the most trouble with. Part of my problem is to think about the numbers that would prove the statement sufficient/insufficient. For example, in statement 1, if a=-5 and b=2, then -5 l 2 l < -5 - (2) Yes. So at this point, I think to myself what numbers can I plug-in to prove that statement 1 insufficient. This is when I get in trouble because I spend too much time thinking about what numbers do I need to plug in next. So I just pick another random number: a=-5 and b=-2, then -5 l -2 l < -5 - (-2) Yes. By this time I'm probably close to the 2-minute mark.

How do you know what numbers to test efficiently? Can anybody suggest more of this type of questions or any materials that I can practice on? Any advice will be greatly appreciated. Thanks.

This is the type of question that I have the most trouble with. Part of my problem is to think about the numbers that would prove the statement sufficient/insufficient. For example, in statement 1, if a=-5 and b=2, then -5 l 2 l < -5 - (2) Yes. So at this point, I think to myself what numbers can I plug-in to prove that statement 1 insufficient. This is when I get in trouble because I spend too much time thinking about what numbers do I need to plug in next. So I just pick another random number: a=-5 and b=-2, then -5 l -2 l < -5 - (-2) Yes. By this time I'm probably close to the 2-minute mark.

How do you know what numbers to test efficiently? Can anybody suggest more of this type of questions or any materials that I can practice on? Any advice will be greatly appreciated. Thanks.

Such questions are best solved using part logic and part number plugging. When you plug numbers, keep in mind that you have to try to get the answer but keep life as simple as possible for yourself. Let me explain what I mean:

If a and b are integers, and |a| > |b|, is a·|b| < a – b? 1. a < 0 2. ab >= 0

Read the question stem: "If a and b are integers" - very good .. no fractions to worry about "and |a| > |b|" - absolute value of a is greater than absolute value of b.. we don't know anything about their signs

"is a·|b| < a – b" There is no obvious relation between the left hand side (LHS) and the right hand side(RHS) so I need to move on and look at the statements.

1. a < 0 a is negative means LHS is negative or 0 (if b is 0). RHS could be negative or positive depending on value of b. Assume b = 0 (makes life simple) We get 0 < a. Inequality does not hold since a is negative. Assume b is a large negative number say, -10 and a is a number a little smaller than b. LHS is a large negative number and RHS is a small negative number. e.g. a = -11, b = -10 -110 < -1 Inequality holds.

Insufficient.

2. ab >= 0 This means EITHER a is negative, b is negative (or one or both are 0) OR a is positive, b is positive (or one or both are 0) Now notice that even with both statements together, you cannot say whether the inequality holds. With statement 1, we saw two cases - b large negative, a is a little smaller than b (inequality holds) a negative, b is 0 (inequality does not hold) According to this statement as well, both cases are possible. Hence this statement alone is not sufficient and both together are also not sufficient.

Re: If a and b are integers, and |a| > |b|, is a |b| < a [#permalink]

Show Tags

01 Feb 2013, 16:25

VeritasPrepKarishma wrote:

Samwong wrote:

This is the type of question that I have the most trouble with. Part of my problem is to think about the numbers that would prove the statement sufficient/insufficient. For example, in statement 1, if a=-5 and b=2, then -5 l 2 l < -5 - (2) Yes. So at this point, I think to myself what numbers can I plug-in to prove that statement 1 insufficient. This is when I get in trouble because I spend too much time thinking about what numbers do I need to plug in next. So I just pick another random number: a=-5 and b=-2, then -5 l -2 l < -5 - (-2) Yes. By this time I'm probably close to the 2-minute mark.

How do you know what numbers to test efficiently? Can anybody suggest more of this type of questions or any materials that I can practice on? Any advice will be greatly appreciated. Thanks.

Such questions are best solved using part logic and part number plugging. When you plug numbers, keep in mind that you have to try to get the answer but keep life as simple as possible for yourself. Let me explain what I mean:

If a and b are integers, and |a| > |b|, is a·|b| < a – b? 1. a < 0 2. ab >= 0

Read the question stem: "If a and b are integers" - very good .. no fractions to worry about "and |a| > |b|" - absolute value of a is greater than absolute value of b.. we don't know anything about their signs

"is a·|b| < a – b" There is no obvious relation between the left hand side (LHS) and the right hand side(RHS) so I need to move on and look at the statements.

1. a < 0 a is negative means LHS is negative or 0 (if b is 0). RHS could be negative or positive depending on value of b. Assume b = 0 (makes life simple) We get 0 < a. Inequality does not hold since a is negative. Assume b is a large negative number say, -10 and a is a small negative number. LHS is negative and RHS is positive. Inequality holds. Insufficient.

2. ab >= 0 This means EITHER a is negative, b is negative (or one or both are 0) OR a is positive, b is positive (or one or both are 0) Now notice that even with both statements together, you cannot say whether the inequality holds. With statement 1, we saw two cases - a small negative, b large negative (inequality holds) a negative, b is 0 (inequality does not hold) According to this statement as well, both cases are possible. Hence this statement alone is not sufficient and both together are also not sufficient.

Thank you for answering my question. However, in statement 1, I don't see how the RHS can be positive when "a" is negative with the given condition |a| > |b|. If b = -10 then "a" has to be less than -10 (ie -11, -12, -13...) Thus, -11 - ( -10) = -1 RHS = negative. Please check whether I miss something. Thanks.

Thank you for answering my question. However, in statement 1, I don't see how the RHS can be positive when "a" is negative with the given condition |a| > |b|. If b = -10 then "a" has to be less than -10 (ie -11, -12, -13...) Thus, -11 - ( -10) = -1 RHS = negative. Please check whether I miss something. Thanks.

Yes, you are right. |a| cannot be smaller than |b| so we should take numbers where a is a little less than b to get a small negative on RHS. The LHS will be negative with a greater absolute value. a = -11, b = -10 -110 < -11 - (-10) -110 < -1 (inequality holds) _________________

Re: If a and b are integers, and |a| > |b|, is a |b| < a [#permalink]

Show Tags

16 Apr 2013, 14:39

OK, my process for solving this was way simpler than all this number plugging and stuff I'm seeing, but maybe I'm doing something wrong and I just happened to get the right answer. Here's my thought process.

1) Manipulate the question stem

is a - |b| < a - b ? - subtract 'a' from both sides to get

is -|b| < -b ? the answer is 'yes' if 'b' is negative, and 'no' if 'b' is non-negative, so in order to be sufficient the data needs to tell us definitively the sign of 'b'

1) a < 0 tells us nothing about the sign of 'b', INSUFFICIENT

2) ab >= 0 tells us that 'a' and 'b' have the same sign, or that 'a' or 'b' or both are zero. From the original question we know that |a| > |b|, so 'a' cannot be zero, which means this statement is telling us that either 'a' and 'b' have the same sign, or b=0. This does nothing to establish the sign of 'b', INSUFFICIENT

1 & 2 together: applying " a < 0 " to "ab >= 0 " tells us that 'b' must non-positive, but can still equal zero or any negative number greater than 'a'. Since there are multiple possibilities for the sign of 'b', we cannot answer the original question of " is -|b| < -b ?", so the answer is E, statements 1 and 2 are INSUFFICIENT

Is this valid logic? I think it hinges on the question of whether or not you can manipulate the question stem by subtracting 'a' from both sides.

OK, my process for solving this was way simpler than all this number plugging and stuff I'm seeing, but maybe I'm doing something wrong and I just happened to get the right answer. Here's my thought process.

1) Manipulate the question stem

is a - |b| < a - b ? - subtract 'a' from both sides to get

is -|b| < -b ? the answer is 'yes' if 'b' is negative, and 'no' if 'b' is non-negative, so in order to be sufficient the data needs to tell us definitively the sign of 'b'

1) a < 0 tells us nothing about the sign of 'b', INSUFFICIENT

2) ab >= 0 tells us that 'a' and 'b' have the same sign, or that 'a' or 'b' or both are zero. From the original question we know that |a| > |b|, so 'a' cannot be zero, which means this statement is telling us that either 'a' and 'b' have the same sign, or b=0. This does nothing to establish the sign of 'b', INSUFFICIENT

1 & 2 together: applying " a < 0 " to "ab >= 0 " tells us that 'b' must non-positive, but can still equal zero or any negative number greater than 'a'. Since there are multiple possibilities for the sign of 'b', we cannot answer the original question of " is -|b| < -b ?", so the answer is E, statements 1 and 2 are INSUFFICIENT

Is this valid logic? I think it hinges on the question of whether or not you can manipulate the question stem by subtracting 'a' from both sides.

You got the question wrong. It is Is a * |b| < a - b ? (there is a dot there, not a minus sign) _________________

Re: If a and b are integers, and |a| > |b|, is a |b| < a [#permalink]

Show Tags

10 Feb 2015, 02:18

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. _________________

Re: If a and b are integers, and |a| > |b|, is a |b| < a [#permalink]

Show Tags

28 Aug 2016, 05:46

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. _________________

This is the kickoff for my 2016-2017 application season. After a summer of introspect and debate I have decided to relaunch my b-school application journey. Why would anyone want...

Check out this awesome article about Anderson on Poets Quants, http://poetsandquants.com/2015/01/02/uclas-anderson-school-morphs-into-a-friendly-tech-hub/ . Anderson is a great place! Sorry for the lack of updates recently. I...

According to the Nebula Award categories, a novel must be over 40,000 words. In the past year I have written assignments for 22 classes totaling just under 65...