Problem
Set up the goal as an amount
Turn coins into amounts and find combos that total 20 cents — without exceeding what she has (2, 2, 10).
Each coin has a fixed value, so turning counts into amounts makes the total easy to add and compare to the target.
Make Systematic List2.MD.C.8Case: 2 dimes
Two dimes already make 20 cents — nothing else needed, so that's 1 way.
Filling up on the biggest coin hits the target exactly, leaving nothing to add, so this case pins one way.
Make Systematic List2.MD.C.8Case: 1 dime
One dime leaves 10 cents to fill with nickels and pennies — 3 ways to do it.
Fixing the dime fixes the leftover exactly, so we only count the few ways smaller coins split that leftover. Those three ways are: 2 nickels; 1 nickel plus 5 pennies; or 10 pennies.
Make Systematic List2.MD.C.8Case: 0 dimes
With no dimes, only 10 pennies exist, so both nickels must be used to reach 20 cents — 1 way.
The 10-penny supply is capped, so using fewer nickels would need more pennies than she has, leaving exactly one workable combo.
Make Systematic List2.MD.C.8Add up all the ways
Add up the 2-, 1-, and 0-dime cases for 5 ways.
Sorting every way by dime count (0, 1, 2) makes three groups that miss nothing and share nothing, so the group counts add up to the total.
Make Systematic List2.MD.C.8The total number of ways is the sum of the ways counted in each separate case grouped by how many dimes are used.
Why?
Sorting every payment by how many dimes it uses breaks all the ways into three groups that miss nothing and share nothing, so the group counts simply add up to the total.
Why?
A payment can use only 0, 1, or 2 dimes since Mia has just 2 dimes, and each payment has one fixed number of dimes, so every way falls into exactly one of the three groups with none left out and none counted twice.
Order your list by how many of the biggest coin you use, and the leftover amount falls into place.
- 2 dimes → 1 way
- 1 dime → 3 ways
- 0 dimes → 1 way, add up to 5 ways