AMC 8 · 1999 · #6
Grade 1 logicPick an answer.
AMC 8 1999 problem © Mathematical Association of America (MAA AMC). Reproduced for educational use.
There are only five candidates for "least", so the fastest path is Tool #3 (Eliminate Possibilities): find one clue that beats each candidate and cross them off. The moment four names are crossed off, the fifth must be the answer. Tool #1 (Draw a Diagram) supports the count by stacking the clues into a single chain M < J < B < F (plus a side note M < C), so the ordering is visible at a glance and nothing gets missed.
Turn each clue into a </> statement with name initials: J < F, B < F, B > M, C > M, M < J, J < B.
Grade 1 introduces the symbols < and > for comparing amounts. Every clue in the problem is exactly one of those comparisons rewritten with a symbol.
1.NBT.B.3Draw A DiagramEliminate Bo: B > M means Bo beats Moe, so Bo is not the smallest.
Kindergarten compare-two: if Bo has more than Moe, then Bo cannot be the one with the smallest pile.
K.MD.A.2Eliminate PossibilitiesEliminate Coe: C > M shows Coe also beats Moe, so Coe is not the smallest either.
Same compare-two reasoning: a single clue showing Coe beats Moe is enough to rule Coe out.
K.MD.A.2Eliminate PossibilitiesEliminate Jo: M < J means Jo has more than Moe, so Jo is not the smallest.
One direct comparison again: Jo > Moe means Jo cannot hold the smallest amount.
K.MD.A.2Eliminate PossibilitiesEliminate Flo by chaining: F > J and J > M give F > M, so Flo beats Moe too.
Grade 1 "order three objects" is exactly this move: if Flo > Jo and Jo > Moe, then Flo > Moe without ever comparing them directly.
1.MD.A.1Eliminate PossibilitiesAll four others are eliminated, so the bottom of the chain M < J < B < F is the least — Moe, answer (E).
Lining the five names up on a number line makes Moe's bottom spot obvious — the same transitive ordering Grade 1 uses for "shortest to tallest".
1.MD.A.1Draw A DiagramIf a clue says someone has more money than Moe, that person cannot be the least — and Bo, Coe, Jo, and Flo all get knocked out by exactly that rule, leaving Moe. The only Grade 1 idea you need is "order objects from least to greatest, using the chain rule."