AMC 10 · 2012 · #11
Grade 6 arithmeticPick an answer.
AMC 10 2012 problem © Mathematical Association of America (MAA AMC). Reproduced for educational use.
The question asks "how many ways," so Tool #2 (Make a Systematic List) drives the count: decide the desserts in a smart order instead of guessing. Tool #7 (Identify Subproblems) turns one hard "count the whole week" into seven easy "count one day" pieces that multiply together. Tool #5 (Look for a Pattern) spots that every day except Friday has the same 3 choices, which collapses the product into a single power of 3 and guards against the trap of also giving Friday a factor.
Anchor Friday, then count outward
Friday is forced to be cake, so fix it and pick each day beside one already chosen: it need only differ from that neighbor, 4-1=3 ways.
Fixing one neighbor rules out exactly one dessert, leaving three.
3.OA.A.1Make A Systematic ListMultiply the independent day-counts
The 6 non-Friday days each have 3 independent choices and Friday contributes 1, so the multiplication principle gives 3⁶.
Independent choices combine by multiplying, and six identical factors of 3 pack into 3⁶.
Independent choices combine by multiplying, and six identical factors pack into one power.
▸ Why?
Each day is chosen without regard to the far days, so the counts multiply.
▸ Why?
Multiplying the same count over and over is exactly what a power records.
Evaluate the power of 3
Multiply step by step: 3²=9, 3³=27, 3⁴=81, 3⁵=243, and 3⁶=729, which is choice (A).
Six threes multiplied together is 729, the smallest listed choice.
5.NBT.B.5Look For A PatternPin down the forced day first, then every other day has just 3 choices, so multiply: 3⁶=729.
- Anchor Friday, then count outward
- Multiply the independent day-counts
- Evaluate the power of 3