AMC 10 · 2012 · #13
Grade 6 algebraPick an answer.
AMC 10 2012 problem © Mathematical Association of America (MAA AMC). Reproduced for educational use.
The question asks for a largest and a smallest value, so this is a max/min problem — Tool #14 (Extreme Principle) is the spine. But you cannot compare orderings until you know how much each slot actually counts. So first use Tool #4 (Introduce a Variable): call the chosen order a,b,c,d,e and write the chain of averages. Then Tool #5 (Look for a Pattern): unfold the nested averages to reveal a fixed weight on each slot. Once the weights are exposed, Tool #14 makes the extremes obvious — to make the total as large as possible you put the biggest numbers on the heaviest slots, and to make it smallest you do the reverse. Tool #7 (Identify Subproblems) keeps the finish clean: compute the max, compute the min, then subtract.
Name the order and chain the averages
Call the order a, b, c, d, e. The first mean is (a+b)/2, and each later mean averages the running value with the next number.
Naming the order with letters turns a vague "some arrangement" into an exact expression you can push on.
6.SP.A.3Introduce A VariableUnfold the nesting into slot weights
Substituting each mean into the next halves everything already there, so the five slots carry weights 1, 1, 2, 4, 8 over 16.
The number folded in last never gets re-halved, so later slots weigh far more — the weights double down the line: 1,1,2,4,8.
The number folded in last never gets halved again, so the later slots weigh far more.
▸ Why?
Each earlier slot passes through one more halving, so the weights change by a fixed factor down the line.
▸ Why?
Each average shares its two inputs equally, which is where every one of those halvings comes from.
Heaviest slots get the biggest numbers
Extreme Principle: give the biggest numbers to the heaviest slots — 5, 4, 3 on weights 8, 4, 2 — so the maximum is 65/16.
A dollar counts most where the multiplier is biggest — so spend your largest values on your heaviest weights.
6.NS.C.7Extreme PrincipleReverse it for the smallest value
Same weights, opposite pairing: 1, 2, 3 on weights 8, 4, 2 and 4, 5 on the light slots, giving a minimum of 31/16.
Flipping the pairing sends the least value to the heaviest slot, dragging the weighted average as low as it can go.
6.NS.C.7Extreme PrincipleSubtract to get the gap
Both share denominator 16, so the gap is 65/16 - 31/16 = 34/16 = 17/8, choice (C).
Same denominators means the gap is just the numerator difference over 16, then reduce.
5.NF.A.1Identify SubproblemsThis chained averaging is really a weighted average where the last number counts most: the slot weights are 1,1,2,4,8 over 16. Put the biggest numbers on the heaviest slots for the max (65/16), flip it for the min (31/16), and the gap is 17/8.
- Name the order and chain the averages
- Unfold the nesting into slot weights
- Heaviest slots get the biggest numbers
- Reverse it for the smallest value
- Subtract to get the gap