AMC 10 · 2010 · #2
Grade 4 arithmeticPick an answer.
The total splits cleanly into two questions that can be answered one at a time — how many trips were there, and how many tourists rode each trip — so Tool #7 (Identify Subproblems) sets the shape of the work. The split matters because the two halves are not equally hard. The adding is routine; the trip count is the entire difficulty, and a wrong count silently corrupts every load that follows it. Tool #2 (Make a Systematic List) settles that count by writing the departures out and checking them against a rule for counting a run with both ends included. Tool #5 (Look for a Pattern) turns the step-by-step 'one fewer' rule into a direct formula for the load on any given trip, which is what pins the last trip at 95. Tool #14 (Extreme Principle) brackets the total between the smallest and largest possible six-load days before any exact adding happens. Tool #3 (Eliminate Possibilities) finishes with a test that does not repeat the addition at all: a divisibility check that every six-trip total must pass.
Count the trips, not the hours
Counting the departures gives six trips.
Five one-hour gaps are fenced off by six posts, and it is the posts, not the gaps, that carry tourists.
Five one-hour gaps are fenced off by six departures, and it is the departures that carry tourists.
▸ Why?
Each departure is one item and each gap is one space between items, so there is always one more item than gap.
▸ Why?
The departures come at the same fixed spacing, so the count follows from the span and the step alone.
Get each trip's load
Each load drops by one from the first.
The load falls once per gap between trips, not once per trip, so five drops separate the first boat from the last.
4.OA.C.5Look For A PatternBracket the total before adding
Bracketing the total first is a useful check.
Six boatloads of roughly a hundred must land a little under six hundred.
4.OA.A.3Extreme PrincipleAdd by leaning on 100
Leaning on the first load gives 585.
Pretend every boat left full at a hundred, then give back the fifteen seats that were actually missing.
4.NBT.B.4Identify SubproblemsCheck the shape of the total
The total's shape confirms 585, choice (C).
A six-in-a-row total always comes out odd and on a multiple of three, and exactly one choice does both.
4.OA.B.4Eliminate PossibilitiesCount the boats, not the hours between them — 10 AM through 3 PM is six departures — then pretend all six left full at a hundred and give back the fifteen missing seats.
- Count the trips, not the hours
- Get each trip's load
- Bracket the total before adding
- Add by leaning on 100
- Check the shape of the total