Problem
Reasoning · Grade 2-2 Problem Solving with Tables
Set up the seat total
With no empty seat the seats must total exactly 46.
Each table fills with a fixed group size, so we just need groups of 4 and groups of 6 that combine to 46.
3.OA.A.3Make A Systematic ListTry each number of 6-seat tables in order
Step the six-seat count up from 0 and test each remainder against 4.
Stepping the 6-seat tables up one at a time means we never skip a possibility and never count one twice.
3.OA.A.4Look For A PatternStepping the number of 6-seat tables up one at a time reaches every possibility once and none of them twice.
Why?
A seating plan has one definite number of 6-seat tables, so it falls into exactly one row of the sweep.
Why?
For each choice, what is left of the 46 seats must break into whole groups of 4, and any leftover kills that row at once.
Collect the working combinations
The ones that work are (10,1), (7,3), (4,5), (1,7) — four ways.
Counting the rows of our organized list gives the number of ways directly.
2.OA.A.1Make A Systematic ListListing the 6-seat tables in order, none-then-one-then-two, lets you find every seating with no empty chairs - just Grade 3 grouping you already know!
- Set up the seat total
- Try each number of 6-seat tables in order
- Collect the working combinations