Patterns & Reasoning
94 problem types · Pick a group to see its problem types.
A figure or sequence that grows by a fixed amount each step is captured by a rule (often multiplication plus a constant) that predicts any term, including table symmetries and neighbor-difference rules. Learners move from skip-count steps and block stacks to perimeter-of-nth-figure and fraction-sequence rules. Generalizing from a few cases to a formula is core algebraic reasoning.
21 types →A pattern that repeats with a fixed period lets you find a far-off term using its position within the cycle (remainder on dividing by the period). Learners use weekday and shape/color cycles, repeating clock times, and number-line intervals. Periodicity plus remainder reasoning answers 'what is the Nth item' without listing all.
9 types →A division that never terminates still has a rule: the remainders cycle, so the digits after the point repeat in a fixed block. Once a child finds the block, any far-off decimal place is a remainder question rather than a long division -- the 18th or the 20th digit costs the same as the 3rd. This is where 'the division does not end' turns from a dead end into a pattern. In grade 8 the same block runs the other way: a k-digit repeating block is that block over k nines, so sums, reversals and digit conditions on the block become fraction arithmetic.
5 types →A remainder is what is left after exact grouping, and it must stay smaller than the divisor. Problems range from finding common multiples and numbers meeting divisibility clues, to recovering a dividend from quotient-and-remainder, adjusting a total to leave no remainder, rounding bundles up, and maximizing a remainder. The controlling fact is the division algorithm: dividend = divisor x quotient + remainder.
27 types →A run of consecutive or evenly spaced numbers adds up to the middle value times the count (or pairs with a constant sum). Children first add short runs, then generalize to long sequences and grid relations where pairing collapses a tedious sum into one product. The insight reappears as the arithmetic-series shortcut.
7 types →When a table or graph has several blanks linked by clues (a total, a ratio, a difference), solve the entries you can pin down first, then use them to unlock the rest in sequence. Learners fill missing data from conditions, complete graphs from clues, and chain knowns to unknowns. It is constraint-propagation applied to data displays.
6 types →Two interacting categories (right vs wrong answers, animals with different leg counts, coins of different values) combine into one total; the counts are recovered by assuming one case and adjusting, or by systematic guess-and-check. This is the elementary precursor to systems of equations.
4 types →When pieces are joined with overlap, the combined length is the sum of the parts minus the overlapping portion — and with several strips the overlaps number one fewer than the strips. The idea runs from taped lengths to multiplied strips to fraction distances. It is the first taste of inclusion-exclusion.
8 types →Spacing objects along a line or loop ties the object count to the gap count: on an open path posts are one more than gaps, on a closed loop they are equal. Problems compute trees, posts, or intervals from length and spacing. The off-by-one fencepost relation is a classic trap the archetype trains learners to see.
7 types →