Find the smallest range
Practice problem
A data set consists of integers. Its mean is , and its median is .
What is the minimum possible range of the data set?
Why this matters on the SAT
Usually you’re given a list and asked for its mean or median. Some SAT questions flip that around. They fix the mean and the median, say, and ask for the smallest possible range. Now there’s no list to work from. You have to build one that pushes the range as low as it can go.
Solution to the example
Start with what can’t change. Nine values with a mean of must add up to
Put the values in order. The fifth one is the median, . Could the range be or less? The smallest value is at most , so the largest would be at most . Then the first five values are at most each, and the last four are at most each. Even the biggest total you could reach is
which is short of . So the range has to be at least .
And works. Keep the first five values at and make the last four . That’s , right on target:
Its median is , and its range is . The answer is B.
Notice the two parts. The first shows that nothing smaller than can work. The second shows that really can. You need both: a bound on its own might name a value no list can reach, and a list on its own doesn’t show you can’t do better. Bound it, then build it.
SAT example
A data set consists of integers. The mean of the data set is , and the median is .
What is the minimum possible range of the data set?
Start by writing the unknown values in order, from least to greatest:
Each position is a slot. Now every condition in the question becomes a rule about certain slots. In the opening example, the mean made the total , the median locked slot at , and the range tied the smallest and largest values together. Here’s the same idea for any list of values:
What each condition tells you about the slots
| Condition | What it means for the slots |
|---|---|
| A mean of for values | The total is . |
| A median of , with an odd number of values | The middle slot is . Slots to its left are at most , and slots to its right are at least . |
| A range of | , so the largest minus the smallest is fixed. Move one end and the other has to move with it. |
| Positive integers | Every slot is one of . |
| Distinct integers | No two slots are equal, so each is bigger than the one before: . |
| Values from through | Every slot sits between the two bounds: . |
Say positive integers have median . The middle of values is slot , so the slots start out like this:
The median locks slot six
| Slots | - | - | |
|---|---|---|---|
| What the order allows | At most | Exactly | At least |
| Smallest positive values, if repeats are allowed |
This doesn’t answer anything yet. It shows what’s locked, so you can see which slots are still free to push.
If the values must be distinct, you can’t use a number twice, so every between slots becomes . When you need the smallest or largest values allowed, use consecutive integers. For example, three distinct positive integers can’t all be . The smallest they can be is , and .
Once the slots are set, ask what the question wants large or small, and which slots feed it.
Here’s the catch. Whatever you push, the other slots have to make up the difference. A value that looks like the extreme isn’t the answer until the rest of the list can still reach the total, stay in order and follow every rule.
Say values must add up to , and you want the greatest as large as possible. If the other add up to , the greatest get . Shrink those to a total of , and the greatest get . Every bit you take from the rest goes to the group you want.
In general, call the group you want large and everything else , the complement of . If all values have a fixed total , then
So to make large, make small:
This is most useful when is the greatest values. Then holds the smaller values, and the median often sets how small some of them can be.
A set of positive integers has mean and median . The greatest values form group B. What is the greatest possible mean of B?
It’s tempting to start by making the largest values huge. But that can break the total, or leave no values that work on the median’s side of the list. If you get stuck, back up: turn the mean into a total, mark the locked slots, then decide which leftover sum to make small or large.
Watch how much of the work happens before you touch the four greatest values.
Worked example
Data set A consists of positive integers with a mean of and a median of . Data set B consists of the greatest integers in data set A.
Which choice is the maximum possible value of the mean of data set B?
Step 1
Eleven values with a mean of add up to
Write them in order:
With values, slot is the middle, so it holds the median:
Step 2
The four greatest values sit in slots through . Their complement is slots through :
The total is fixed, so the smaller you make slots through , the more is left for the four greatest.
Step 3
The values only have to be positive, so slots through can each be . Slot is locked at , and slot can’t be less than the median, so it’s at least :
That leaves at most
for the four greatest, so their mean is at most
Step 4
So far you know the mean can’t go above . Now show that a list gets there. Keep slots through as small as allowed, five s and five s, and give everything left to slot : .
It has positive integers, its total is
and its median is . Its four greatest values are , with mean
The list reaches the bound, so the answer is C.
If the positive integers in the example also had to be distinct, what would be the smallest possible sum of the first seven values?
After step 3, it’s tempting to pick and move on. But the inequality only shows the mean can’t go higher. It doesn’t show that any list gets there. Finish by writing a complete list in order and checking every condition.
Shrinking the complement works when you want the greatest values large. To make the median large, you need a different finish, but you still start from the slots.
Suppose a data set has positive integers, mean , and range . You want the greatest possible median.
The total is
Could the median be or more? Look at what that forces. The largest value is at least the median, so it would be at least . With a range of , the smallest value would then be at least
So the first four values would each be at least , and the last five, from the median up, would each be at least . The smallest total you could get is
which is more than . So the median can’t be or more.
Now build a list with median . Put the median and the four values above it at , which uses . That leaves for the first four. The range makes the smallest value , and :
Its total is , its range is , and its median is . So the greatest possible median is
The target changed, but the moves didn’t: turn the conditions into slots, rule out anything better, then build and check the list that reaches the limit.
The list above has median . Why doesn’t that list alone prove that is the greatest possible median?
Before you pick an answer, check your list against the question, not against what you meant to write.
Check the finished list
| Check | Ask yourself |
|---|---|
| Count | Are there exactly values? |
| Order | Are the values written from least to greatest? |
| Number rules | Is every value an integer? If the question asks, is each one positive, within the bounds and different from the rest? |
| Mean | Does the total equal times the given mean? |
| Median | Is the right value sitting in the middle slot? |
| Range | Does the largest value minus the smallest equal the given range, or the one you’re claiming? |
| The question | Does the group or statistic the question asks about actually reach your answer? |
Do these by hand. Desmos can add up a finished list, but it can’t tell you which slots to squeeze, which inequality proves nothing does better, or whether distinct values change the best arrangement.
These three match what you’ve seen: the smallest range, the largest mean of the greatest values, and the largest median. The second adds distinct values and a cap.
Practice problem
A data set consists of integers. Its mean is , and its median is .
What is the minimum possible range of the data set?
Practice problem
Data set A consists of distinct integers, each from through , inclusive. The mean of data set A is . Data set B consists of the greatest integers in data set A.
What is the maximum possible value of
Practice problem
A data set consists of positive integers. Its mean is , and its range is .
What is the greatest possible median of the data set?
Finish the lesson
Finish the remaining questions correctly to complete this lesson.
Next lesson
Move from constructing one-variable data to interpreting direction, strength, form, clusters, and outliers in paired data.
Start next lessonPractice
31 SAT questions use what this lesson teaches. Practice a few in a study session at the difficulty you choose.
Start practice