-
Target Test Prep's 2024 GMAT Focus Edition prep is discounted for the BTG community!
Redeem
Dealing with Very Hard Max/Min Statistics Problems
Last week, we tackled two GMATPrep questions; if you missed that article, go read it before continuing with this one. Make sure you try the two sample problems and take the time to master the concepts before you try the super-hard question below.
Okay, this sample problem is from our own archives. Set your timer for 2 minutes. and GO!
Both the average (arithmetic mean) and the median of a set of 7 numbers equal 20. If the smallest number in the set is 5 less than half the largest number, what is the largest possible number in the set?(A) 40
(B) 38
(C) 33
(D) 32
(E) 30
You have an answer, right? Even if you dont know what the answer is and you have to guess youve still picked an answer, right? If you havent, go pick an answer before you keep reading!
As we discussed last week, the most important thing to notice here is the word largest. This one word is going to be the determining factor in how we set this problem up, right from the very beginning.
So, we have a set of 7 numbers. The average of those 7 numbers is 20; can we calculate anything from that? Yes the sum! The basic formula for an average is A = S/n, where A is the average, S is the sum, and n is the number of items. We know A and n, so plug the two numbers in to get 20*7 = 140 for the sum.
The problem is asking us to maximize one figure: the last (and, of course, highest) number in the set. If all 7 numbers have to add up to 140, and we want to make one number as large as possible, then what do we have to do to the remaining six numbers?
We have to minimize all 6 of the remaining numbers so, for the rest of the problem, we need to figure out how to make the other 6 numbers as small as possible.
Do we know anything about those 6 other numbers? We were told that the median is 20; what does that mean? Draw out some dashes on your scrap paper, one for each number in the set:
____ ____ ____ ____ ____ ____ ____
Now, how can we represent the fact that the median is 20? We have an odd number of terms. The median will be the middle term (the 4th, in this case) and it will actually equal 20. So add that to your diagram, along with an x for the term were supposed to maximize:
____ ____ ____ _20_ ____ ____ __x__
The problem also gives us some info about the first term:
the smallest number in the set is 5 less than half the largest number
Hmm. We dont know what the largest number is, of course thats what the problem asks us to maximize! But were calling that largest number x so lets write the smallest term in terms of x: ()x 5. Add that to the diagram:
_()x 5_ ____ ____ _20_ ____ ____ __x__
Okay, now what whats our goal again? Oh, right, we want to minimize everything that isnt that last term, x. Okay, so what can we minimize? We cant change the 1st term; thats going to be ()x 5 no matter what. And we cant change the fourth term; thats going to be 20 no matter what. What about the 2nd, 3rd, 5th, and 6th terms? What are the smallest possible values for each of those?
Lets start with the rules for writing out a bunch of numbers in order to show a median. When you write a set of numbers to find the median, the requirement is to write the numbers from smallest to largest. Lets say that we have to write these three numbers in order: 20, 14, 18. We would write them: 14, 18, 20. Moving to the right, each number is higher than the previous number. Moving to the left, each number is lower than the previous number.
Is that all? What if we had to write these three numbers in order: 20, 14, 20? Then, we would write: 14, 20, 20. Moving to the right, the second term, 20, is higher than the first term, 14, but the third term, 20, is equal to the second term, 20. So the full rule is not that the numbers have to increase as you move to the right or decrease as you move to the left. The rule is that, as you move to the right, the number has to be equal to or higher than the number to the left. Similarly, as you move to the left, the number has to be equal to or lower than the number to the right.
So, lets get back to our problem. Were trying to minimize the remaining slots. What is the smallest possible value for the 5th term, keeping in mind that the number has to be equal to or higher than the 4th term? The 4th term is 20, so the smallest value for the 5th term is also 20. For the same reason, the smallest value for the 6th term is also 20.
_()x 5_ ____ ____ _20_ _20_ _20_ __x__
What about the 2nd and 3rd terms? The 2nd term has to be equal to or higher than the 1st term, and the first term is ()x 5. Therefore, the smallest possible value for the 2nd term is equal to ()x 5. For the same reason, the smallest value for the 3rd term is also ()x 5.
_()x 5_ _()x 5_ _()x 5_ _20_ _20_ _20_ __x__
Now we have representations for all seven terms: either real numbers or variable expressions. We know the seven terms add up to 140. Time to set up an equation and solve for x!
[()x 5] + [()x 5] + [()x 5] + 20 + 20 + 20 + x = 140
(3/2)x 15 + 60 + x = 140
(5/2)x = 95
x = 95(2/5)
x = 38
The correct answer is B.
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!)
Note: the key takeaways are the same as last week, when we did some lower-level max/min problems. The basic process doesn't change; we just have a bit more we need to know and a bit more we need to do on the very hard problem we did this week.
Recent Articles
Archive
- 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