Events & Promotions
|
|
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
Track
Your Progress
Practice
Pays
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Aug 2610:00 AM EDT
-11:59 PM EDT
Save up to $1,000 on select GMAT prep now. This Fall, achieve your most ambitious goals with millions of student success stories behind you.
Aug 2710:00 AM EDT
-11:00 AM EDT
We’ve worked incredibly hard to build TTP into the best test prep experience possible, and it would mean a lot to us to win Newsweek’s 2026 Readers’ Choice Award for Best Test Prep. If TTP has helped you, we’d be incredibly grateful for your vote.
Sep 0609:30 AM EDT
-12:30 PM EST
Top scores are possible when you enroll in a powerful EA course, taught live online + 6 months access to TTP OnDemand video courses included! Perfect class schedule and easy course access for working professionals. Class starts Sept. 6, 9:30am-12:30pm EST
Sep 0907:00 AM PDT
-10:00 AM PDT
Meet AdComs and explore top Master’s programs - MiM, MiF, MSc, MSBA and more. - Application Fee Waivers - Free 1-Week of GMAT Club Tests: - Master's Application Toolkit - Grand Prize Giveaway
Sep 1507:00 PM EDT
-09:00 PM EST
Elite scores are possible when you enroll in a powerful GMAT course, taught live online + 6 months access to TTP OnDemand video courses included! Class starts Tues/Thurs Sept. 15, 2026 - Nov. 15, 2027, 7:00pm-9:00pm EST
Sep 2108:00 PM EDT
-10:00 PM EDT
Elite scores are possible when you enroll in a powerful GMAT course, taught live online + 6 months access to TTP OnDemand video courses included! Class starts Tues/Thurs Oct. 13, 2026 - Jan. 7, 2027, 8:00pm-10:00pm EST
21 Jan 2024, 11:00
Kudos
Bookmarks
B
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!
Difficulty:
55%
(hard)
Question Stats:
66% (02:16) correct
34%
(02:03)
wrong
based on 494
sessions
History
Date
Time
Result
Not Attempted Yet
The function max(a, b) returns the largest, and min(a, b) returns the smallest value among the given numbers a and b. If a and b are distinct numbers, which of the following must be true?
I. max(a, b) + min(a, b) > 0
II. max(a, b) = (a + b + |a - b|)/2
III. min(a, b) < (a + b - |a - b|)/2
A. I only
B. II only
C. III only
D. I and II only
E. I, II, and III
I. max(a, b) + min(a, b) > 0
II. max(a, b) = (a + b + |a - b|)/2
III. min(a, b) < (a + b - |a - b|)/2
A. I only
B. II only
C. III only
D. I and II only
E. I, II, and III
22 Jan 2024, 09:04
Kudos
Bookmarks
The function \(max(a, b)\) returns the largest, and \(min(a, b)\) returns the smallest value among the given numbers \(a\) and \(b\). If \(a\) and \(b\) are distinct numbers, which of the following must be true?
I. \(max(a, b) + min(a, b) > 0\)
II. \(max(a, b) = \frac{a + b + |a - b|}{2}\)
III. \(min(a, b) < \frac{a + b - |a - b|}{2}\)
A. I only
B. II only
C. III only
D. I and II only
E. I, II, and III
Let's evaluate each option
I. \(max(a, b) + min(a, b) > 0\)
If we assume \(a > b\), then the above expression becomes \(a + b > 0\). However, this is not necessarily true, as the fact that one number is greater than another does not guarantee a positive sum. The same result occurs if we assume \(a < b\). Therefore, this option is not always true.
II. \(max(a, b) = \frac{a + b + |a - b|}{2}\)
If \(a > b\), then the left-hand side, \(max(a, b)\), equals \(a\). Since in this case, \(|a - b| = a-b\), the right-hand side, \(\frac{a + b + |a - b|}{2}\), equals \(\frac{a + b + a - b}{2}=a\). Thus, for this case, LHS = RHS.
If \(a < b\), then the left-hand side, \(max(a, b)\), equals \(b\). Since in this case, \(|a - b| = -(a-b)\), the right-hand side, \(\frac{a + b + |a - b|}{2}\), equals \(\frac{a + b - (a - b)}{2}=b\). Again, for this case, LHS = RHS.
Hence, this option must be true.
III. \(min(a, b) < \frac{a + b - |a - b|}{2}\)
If \(a > b\), then the left-hand side, \(min(a, b)\), equals \(b\). In this case, \(|a - b| = a-b\), and the right-hand side, \(\frac{a + b - |a - b|}{2}\), equals \(\frac{a + b - (a - b)}{2}=b\). Therefore, for this case, LHS = RHS.
If \(a < b\), then the left-hand side, \(min(a, b)\), equals \(a\). Here, \(|a - b| = -(a-b)\), and the right-hand side, \(\frac{a + b - |a - b|}{2}\), equals \(\frac{a + b + (a - b)}{2}=a\). So, once again, for this case, LHS = RHS.
Thus, this option must NOT be true.
Therefore, only option II is always true!
Answer: B
General Discussion
21 Jan 2024, 11:26
Kudos
Bookmarks
Bunuel
This is a "MUST be true" type of question.
Let's evaluate the options -
I. max(a, b) + min(a, b) > 0
If 'a' and 'b' are negative, both max(a,b) and min(a,b) will be negative. In that case, max(a, b) + min(a, b) will also be negative. Hence, the stated inequality is not always true. We can eliminate all options that state option I must be true. Eliminate A, C and D.
II. max(a, b) = (a + b + |a - b|)/2
There are two ways to approach this statement
1) Test out numbers
Case 1: a = -5; b = -10
max(a,b) = -5
min (a,b) = -10
(a + b + |a - b|)/2 = (-5 - 10 + 5)/2 = -5
Hence, max(a, b) = (a + b + |a - b|)/2
Case 2: a = -5; b = 0
max(a,b) = 0
min (a,b) = -5
(a + b + |a - b|)/2 = (-5 - 0 + 5)/2 = 0
Hence, max(a, b) = (a + b + |a - b|)/2
Case 3: a = 0 ; b = 5
max(a,b) = 5
min (a,b) = 0
(a + b + |a - b|)/2 = (0 + 5 + 5)/2 = 5
Hence, max(a, b) = (a + b + |a - b|)/2
Case 4: a = 5 ; b = 6
max(a,b) = 6
min (a,b) = 5
(a + b + |a - b|)/2 = (5 + 6 + 1)/2 = 6
Hence, max(a, b) = (a + b + |a - b|)/2
We can conclude II holds.
2) Logical Approach
|a - b| → Represents the distance between the numbers 'a' and 'b'.
Assume between 'a' and 'b', 'a' is the smaller number. Therefore, max(a,b) = b
In this case, if we add |a - b|, i.e. the distance between 'a' and 'b', to 'a', the resultant number is 'b'.
Therefore, a + |a-b| = b
(a + b + |a - b|)/2 = (b + b)/2 = b
max(a, b) is always equals to (a + b + |a - b|)/2
We can conclude II holds.
Between B and C ⇒ We can eliminate C.
Option B
