If a and b are integers, and |a| > |b|, is a · |b| < a - b?
(1) a < 0
(2) ab > 0
OA :E.Looking for solutions taking less than 2 mins.
(1) a < 0
(2) ab > 0
OA :E.Looking for solutions taking less than 2 mins.
BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course
Redeem
Scott Woodbury-Stewart’s private virtual classroom — 400 hours of master-class video lessons for the GMAT Focus Edition.
I found an answer a hereshubhamkumar wrote:If a and b are integers, and |a| > |b|, is a · |b| < a - b?
(1) a < 0
(2) ab > 0
OA :E.Looking for solutions taking less than 2 mins.
=>|a| > |b| ; Is a · |b| < a - b; Taking few random values of a & b and analysing.shubhamkumar wrote:If a and b are integers, and |a| > |b|, is a · |b| < a - b?
(1) a < 0
(2) ab > 0
OA :E.Looking for solutions taking less than 2 mins.
To save time, try to plug in combinations that satisfy both statements.shubhamkumar wrote:If a and b are integers, and |a| > |b|, is a · |b| < a - b?
(1) a < 0
(2) ab > 0
OA :E.Looking for solutions taking less than 2 mins.
Hi,pemdas wrote:I found an answer a hereshubhamkumar wrote:If a and b are integers, and |a| > |b|, is a · |b| < a - b?
(1) a < 0
(2) ab > 0
OA :E.Looking for solutions taking less than 2 mins.
|a| > |b| could be translated into a^2 > b^2 and a^2-b^2>0 or (a+b)(a-b)>0
Either a-b>0 or a-b<0 (cannot be zero). As we see a*|b| could be Either +ve or -ve.
st(1) a<0 implies a-b<0 or a<b. Sufficient
st(2) ab>=0 Insufficient as the signs of a and b not known
That makes sense and the approach is out of the box.Are you suggesting that if we use both statements and prove that the stem cannot be solved with both statements, then answer would be E.GMATGuruNY wrote:To save time, try to plug in combinations that satisfy both statements.shubhamkumar wrote:If a and b are integers, and |a| > |b|, is a · |b| < a - b?
(1) a < 0
(2) ab > 0
OA :E.Looking for solutions taking less than 2 mins.
Since ab≥0 in statement 2, we should consider b=0.
Let b=0 and a=-1.
|a| > |b|, and both statements are satisfied.
Plugging these values into a · |b| < a - b, we get:
-1 * |0| < -1-0
0 < -1.
NO.
Let b=-1 and a=-2.
|a| > |b|, and both statements are satisfied.
Plugging these values into a · |b| < a - b, we get:
-2 * |-1| < -2-(-1)
-2 < -1.
YES.
Since in the first case the answer is NO, and in the second case the answer is YES, the two statements combined are INSUFFICIENT.
The correct answer is E.
When we plug values into statement 1, the ONLY requirement is that we satisfy statement 1 and any conditions in the question stem.shubhamkumar wrote:That makes sense and the approach is out of the box.Are you suggesting that if we use both statements and prove that the stem cannot be solved with both statements, then answer would be E.GMATGuruNY wrote:To save time, try to plug in combinations that satisfy both statements.shubhamkumar wrote:If a and b are integers, and |a| > |b|, is a · |b| < a - b?
(1) a < 0
(2) ab > 0
OA :E.Looking for solutions taking less than 2 mins.
Since ab≥0 in statement 2, we should consider b=0.
Let b=0 and a=-1.
|a| > |b|, and both statements are satisfied.
Plugging these values into a · |b| < a - b, we get:
-1 * |0| < -1-0
0 < -1.
NO.
Let b=-1 and a=-2.
|a| > |b|, and both statements are satisfied.
Plugging these values into a · |b| < a - b, we get:
-2 * |-1| < -2-(-1)
-2 < -1.
YES.
Since in the first case the answer is NO, and in the second case the answer is YES, the two statements combined are INSUFFICIENT.
The correct answer is E.
Traditionally we are advised to eliminate each statement before using the two together.
New here Create free account