BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course
RedeemGMATPrep® Max/Min Statistics Problems
This week, were going to tackle two GMATPrep questions, this time from the quant side of things. My students have been asking (really, complaining!) about maximize / minimize questions lately. A lot of students arent sure about the most efficient approach to these kinds of questions. Well tackle these two GMATPrep questions this week in order to learn how to master max/min questions in general, and later this month Ill give you a super hard one from our own archives just to see whether you learned the material as well as you thought you did. :)
Lets start with a sample problem. Set your timer for 2 minutes. and GO!
*Three boxes of supplies have an average (arithmetic mean) weight of 7 kilograms and a median weight of 9 kilograms. What is the maximum possible weight, in kilograms, of the lightest box?(A) 1
(B) 2
(C) 3
(D) 4
(E) 5
The most important thing to notice here is the word maximum. This one word is going to be the determining factor in how we set this problem up, right from the very beginning.
Most of the time, when were asked to maximize something, we will need to minimize the remaining variables in the problem. Conversely, if the problem asks us to minimize something, we will usually need to maximize the remaining variables. (There are times, though, when we will need to minimize some other variable in order to minimize the desired thing or maximize some other variable in order to maximize the desired thing so we do need to pay attention.)
This time, theyre asking us to maximize one figure: the lightest box.
If three items have an average weight of 7, then collectively, the three items have a weight of 7x3 = 21. If three items have a median weight of 9, then the middle of the three items is actually 9. This one isnt a variable; we cant change this number. The first (or lightest) of the three, therefore, has to be equal to or less than 9 (because it is to the left of the median). Check the answers quickly in this case, unfortunately, that information doesnt help us to eliminate any answers.
If the middle box is actually 9, then we can subtract that from 21 to get the combined weight for the other two boxes. 21 9 = 12. So the lightest and heaviest boxes have to add up to 12.
Now, do we want to minimize or maximize the weight of the heaviest box?
The heaviest box has to be equal to or greater than 9 (because it is to the right of the median). We want to maximize the weight of the lightest box, so we need to minimize the weight of the heaviest box. So, the smallest possible weight for the heaviest box is 9.
If the heaviest box is minimized to 9, and the heaviest and lightest add up to 12, then the maximum weight for the lightest box is 3. The correct answer is C.
Make sense? If youre sure youve got it, try this harder one. Set your timer for 2 minutes!
*A certain city with a population of 132,000 is to be divided into 11 voting districts, and no district is to have a population that is more than 10 percent greater than the population of any other district. What is the minimum possible population that the least populated district could have?(A) 10,700
(B) 10,800
(C) 10,900
(D) 11,000
(E) 11,100
In this case, there are 11 voting districts, each with some number of people. Were asked to find the minimum possible population in the least populated district or the smallest population that any one district could possibly have.
Lets say that were going to minimize the population in District 1. Because all 11 districts have to add up to 132,000 people, we want to maximize the population in Districts 2 through 10. How can we do that? Now, we need more information from the problem:
no district is to have a population that is more than 10 percent greater than the population of any other district
So, if the smallest district has 100 people, then the largest district could have 110 people but cant have any more than that. If the smallest district has 500 people, then the largest district could have 550 people but cant have any more than that. How did we calculate those numbers? In each case, we take 10% of the original number and add that figure to the original number to give us our maximum.
In the given problem, we dont know the number of people in the smallest district, so lets call that x. If the smallest district is x, then calculate 10% and add that figure to x: x + 0.1x = 1.1x. So the largest district could be 1.1x but cant be any larger than that.
We want to maximize all of the 10 remaining districts, so we should assume that all 10 districts are equal to 1.1x. As a result, we have (1.1x)(10) = 11x people in the 10 maximized districts (Districts 2 through 10), as well as our original x people in the minimized district (District 1).
The problem told us that all 11 districts add up to 132,000, so write that out mathematically:
11x + x = 132,000
12x = 132,000
x = 11,000
The correct answer is D.
Key Takeaways for Max/Min Problems:
- figure out what variables are in play (what figures we can manipulate in the problem)
- figure out whether each variable needs to be maximized or minimized in order to achieve the desired outcome (the thing the problem asks us to do)
- do the work (carefully, as always!)
* GMATPrep questions courtesy of the Graduate Management Admissions Council. Usage of this question does not imply endorsement by GMAC.
Recent Articles
- Best MBA for Real Estate: Top Schools, Career Paths & How to Choose
- The Best MBA Programs for Private Equity and Venture Capital
- Do You Need a Finalized Test Score Before You Hire an MBA Admissions Consultant?
- Best MBA for Entrepreneurship: Top Programs for Founders, Startups & Family Business Owners
- Am I Too Young for a Top MBA Program? Or Too Old?
Archive
- May 2026
- April 2026
- March 2026
- February 2026
- January 2026
- December 2025
- October 2025
- September 2025
- August 2025
- July 2025
- June 2025
- February 2025
- January 2025
- December 2024
- November 2024
- October 2024
- September 2024
- August 2024
- July 2024
- June 2024
- May 2024
- April 2024
- March 2024
- February 2024
- January 2024
- December 2023
- November 2023
- October 2023
- September 2023
- July 2023
- June 2023
- May 2023
- April 2023
- March 2023
- February 2023
- January 2023
- December 2022
- November 2022
- October 2022
- September 2022
- August 2022
- July 2022
- June 2022
- May 2022
- April 2022
- March 2022
- February 2022
- January 2022
- December 2021
- November 2021
- October 2021
- September 2021
- August 2021
- July 2021
- June 2021
- May 2021
- April 2021
- March 2021
- February 2021
- January 2021
- December 2020
- November 2020
- October 2020
- September 2020
- August 2020
- July 2020
- June 2020
- May 2020
- April 2020
- March 2020
- February 2020
- January 2020
- December 2019
- November 2019
- October 2019
- September 2019
- August 2019
- July 2019
- June 2019
- May 2019
- April 2019
- March 2019
- February 2019
- January 2019
- December 2018
- November 2018
- October 2018
- September 2018
- August 2018
- July 2018
- June 2018
- May 2018
- April 2018
- March 2018
- February 2018
- January 2018
- December 2017
- November 2017
- October 2017
- September 2017
- August 2017
- July 2017
- June 2017
- May 2017
- April 2017
- March 2017
- February 2017
- January 2017
- December 2016
- November 2016
- October 2016
- September 2016
- August 2016
- July 2016
- June 2016
- May 2016
- April 2016
- March 2016
- February 2016
- January 2016
- December 2015
- November 2015
- October 2015
- September 2015
- August 2015
- July 2015
- June 2015
- May 2015
- April 2015
- March 2015
- February 2015
- January 2015
- December 2014
- November 2014
- October 2014
- September 2014
- August 2014
- July 2014
- June 2014
- May 2014
- April 2014
- March 2014
- February 2014
- January 2014
- December 2013
- November 2013
- October 2013
- September 2013
- August 2013
- July 2013
- June 2013
- May 2013
- April 2013
- March 2013
- February 2013
- January 2013
- December 2012
- November 2012
- October 2012
- September 2012
- August 2012
- July 2012
- June 2012
- May 2012
- April 2012
- March 2012
- February 2012
- January 2012
- December 2011
- November 2011
- October 2011
- September 2011
- August 2011
- July 2011
- June 2011
- May 2011
- April 2011
- March 2011
- February 2011
- January 2011
- December 2010
- November 2010
- October 2010
- September 2010
- August 2010
- July 2010
- June 2010
- May 2010
- April 2010
- March 2010
- February 2010
- January 2010
- December 2009
- November 2009
- October 2009
- September 2009
- August 2009