Overview
A spatial pattern is a counting problem with geometry organizing the objects. Shared boundaries create duplicates, outer layers differ from interiors, and a route is a sequence of choices constrained by the vertices it visits. Drawing or visualizing the object helps, but a formula should come from a stated counting rule. We will develop that rule for four different spatial structures.
Count what a new square actually adds
A row of unit squares uses one stick per unit edge. The first square needs four sticks. Each additional square shares one side with the existing row, so it adds only three. Thus n squares use 4 + 3(n − 1) = 3n + 1 sticks. Setting this equal to 31 gives n = 10.
The wrong answer 7 rounds down 31/4, treating each square as needing four separate sticks and overlooking shared sides. You can also count n top edges, n bottom edges and n + 1 vertical edges, reaching the same expression. Two independent counts of the same structure provide a useful check. Be clear about whether adjacent objects share a physical piece or merely touch at a point; that detail determines what changes when the pattern grows.
Distinguish a border from the remaining interior
A rectangular grid has r rows and r + 4 columns. Removing its outer border leaves (r − 2)(r + 2) = r² − 4 cells. The border itself is the original r(r + 4) minus that interior, giving 4r + 4. The problem says the remaining interior contains 24 more cells than the removed border.
Therefore r² − 4 − (4r + 4) = 24, or r² − 4r − 32 = 0. Factoring gives (r − 8)(r + 4) = 0. Positive dimensions select r = 8 and twelve columns, so the original grid has 96 cells. The distractors 36 and 60 are the border and interior counts. They are valid intermediate quantities, but the question asks for the original whole. Writing the three quantities with separate labels prevents that last-step confusion.
Classify small cubes by where they lie
A solid made of unit cubes has dimensions n by n by 2n, with all outer faces painted. A unit cube has paint on exactly two faces when it lies on an edge away from a corner. There are four edges in each of the three directions, so the count is 4[(n − 2) + (n − 2) + (2n − 2)] = 16n − 24.
Setting this count to 56 gives n = 5. Cubes with no paint lie inside the outer layer, leaving dimensions 3 by 3 by 8 and therefore 72 cubes. The distractor 27 treats the solid as a cube rather than respecting the doubled third dimension. Classifying positions before counting avoids mixing corners, edge interiors, face interiors and the solid’s interior, each of which has a different number of painted faces.
Corners have three painted faces and therefore do not belong in the two-face count. Subtracting two from an edge length removes its two corner cubes; counting four parallel edges then handles that direction. For the unpainted count, subtracting two from each full dimension removes an entire layer at both ends of that direction. These two uses of subtraction describe different subsets, even though the same expression n − 2 appears.
Correct overlaps when excluding route vertices
A monotone route from (0,0) to (5,3) contains five right moves and three up moves, so there are C(8,3) = 56 unrestricted routes. Routes through (2,1) number C(3,1)·C(5,2) = 30. Routes through (3,2) also number 30. Routes through both have three choices before the first vertex, two between the vertices and three after the second, giving eighteen.
To avoid both vertices, subtract both forbidden groups and restore their overlap: 56 − 30 − 30 + 18 = 14. The answer 26 excludes only one vertex. For transfer, state which objects are counted once and where overlap occurs. In patterns, identify shared edges or layers; in routes, split at required vertices and multiply segment choices. Then check whether the final target is a whole, a boundary, an interior or an allowed remainder.
Apply the method to a new case
A rectangular floor has 5 rows and 7 columns of unit-square tiles. How many tiles touch its outer boundary? The whole rectangle has 35 tiles. Removing the boundary leaves an interior of (5 − 2)(7 − 2) = 15 tiles, so 20 touch the boundary. Counting two long edges and two short edges as 7 + 7 + 5 + 5 gives 24, because each of the four corner tiles was counted twice; subtracting four recovers 20. Check the count by listing seven tiles across each long edge and three noncorner tiles on each short edge: 14 + 6 = 20. The interior method works when both dimensions are at least two; a one-row floor needs a separate case because every tile lies on the boundary. An explicit boundary convention prevents treating an edge length as a tile count without considering corners.