Figure 1: (a) 11 squares (b) 36 sticks (c) no (d) yes, position 49.
Figure 2: (a) 24 squares (b) 73 sticks (c) yes, position 13 (d) no.
Figure 1 — the rule.
Position 1: 1 square + arrowhead = 4 + 2 = 6 sticks
Position 2: 2 squares + arrowhead = 7 + 2 = 9 sticks
Position 3: 3 squares + arrowhead = 10 + 2 = 12 sticks
Each new square adds 3 sticks, so position n has 3n + 3 sticks and n squares.
(a) Position 11 has 11 squares.
(b) Sticks = 3 × 11 + 3 = 36.
(c) 3n + 3 = 85 → 3n = 82. But 82 is not divisible by 3, so no arrangement uses exactly 85 sticks.
(d) 3n + 3 = 150 → 3n = 147 → n = 49. Yes — position 49.
Figure 2 — the rule.
Position 1: 2 rows of 2 squares = 4 squares, 13 sticks
Position 2: 3 rows of 2 squares = 6 squares, 19 sticks
Position 3: 4 rows of 2 squares = 8 squares, 25 sticks
Each new step adds 2 squares and 6 sticks.
Position n has 2n + 2 squares and 6n + 7 sticks.
(a) Squares = 2 × 11 + 2 = 24.
(b) Sticks = 6 × 11 + 7 = 66 + 7 = 73.
(c) 6n + 7 = 85 → 6n = 78 → n = 13. Yes — position 13.
(d) 6n + 7 = 150 → 6n = 143. But 143 is not divisible by 6, so no arrangement uses exactly 150 sticks.
Why it happens: the counting works because neighbouring squares share sticks. In Figure 1 the first square needs 4 sticks and each square after it needs only 3 more, plus 2 for the arrowhead — giving 3n + 3. In Figure 2, each extra step adds one more row of two squares, and joining it to the staircase costs 6 new sticks, giving a jump of 6 each time: 13, 19, 25, 31, … .
Check it yourself: Figure 1, position 49 → 3(49) + 3 = 150 ✓. Figure 2, position 13 → 6(13) + 7 = 85 ✓. The two figures answer opposite halves of parts (c) and (d) — a neat piece of design by the book.