Prealgebra · Lesson 12.3

Draw a Picture

Solve this lesson, free →All lessons

Some problems arrive as a wall of words that is hard to hold in your head all at once. The strongest first move is often not a calculation. It is a sketch. A path becomes a map, a schedule becomes a timeline, and a set of clues becomes dots and arrows you can point at. Once the information is on paper, the answer is usually easy to read straight off it.

Problem
A baker slices a baguette into \(9\) pieces, and each cut takes \(30\) seconds. Sketch the baguette with its cut marks. How many minutes does the slicing take?
Show a hint
  • Draw the loaf and mark the cuts. Nine pieces need one fewer cut than pieces.
Show the full solution

The sketch shows \(8\) cut marks producing \(9\) pieces, since each cut adds exactly one piece to the count.

$$8 \times 30 = 240 \text{ seconds} = \boxed{4} \text{ minutes}$$

Problem
A straight garden path is \(180\) meters long, with a lamp at each end and lamps every \(15\) meters in between. Draw dots for lamps. How many lamps line the path?
Show a hint
  • Count gaps first. The path holds \(180 \div 15 = 12\) gaps.
  • Dots outnumber the gaps between them by exactly one.
Show the full solution

The path divides into \(180 \div 15 = 12\) gaps, and the drawing shows one more lamp than gaps, since both ends hold a lamp.

$$12 + 1 = \boxed{13}$$

Problem
Two boards, each \(30\) cm long, are glued together with an \(8\) cm overlap to make one longer shelf. Draw the two boards overlapping. How many centimeters long is the shelf?
Show a hint
  • Laid end to end they would span \(60\) cm, but the overlapped stretch was counted twice, once inside each board.
Show the full solution

End to end, the boards would cover \(30 + 30 = 60\) cm, but the drawing shows the \(8\) cm overlap belonging to both boards at once, so it was counted twice.

$$60 - 8 = \boxed{52}$$

Problem
On a straight boardwalk, the ice cream stand is \(40\) meters east of the pier, and the arcade is \(25\) meters west of the ice cream stand. Sketch the boardwalk as a line. How many meters is the arcade from the pier?
Show a hint
  • Mark the pier, step \(40\) east to the ice cream stand, then step \(25\) back west for the arcade.
Show the full solution

On the sketch, the arcade lands \(40 - 25 = 15\) meters east of the pier.

$$\boxed{15}$$

Without the line, east and west blur together. With it, the subtraction is obvious.

Problem
A park drone takes off, flies \(9\) blocks east, \(2\) blocks north, \(3\) blocks west, and \(6\) blocks north, then lands. Sketch the flight, then find the straight-line distance in blocks from takeoff to landing.
Show a hint
  • Total the east-west motion and the north-south motion separately. The wandering collapses to one net east amount and one net north amount.
  • Net \(6\) east and net \(8\) north are the legs of a right triangle, and the straight-line distance is its hypotenuse.
Show the full solution

East-west nets to \(9 - 3 = 6\) blocks east, and north-south nets to \(2 + 6 = 8\) blocks north, so takeoff and landing sit at two corners of a right triangle with legs \(6\) and \(8\).

$$d^2 = 6^2 + 8^2 = 100, \qquad d = \boxed{10}$$

Opposite directions cancel, so a wandering trip always collapses to one net east-west amount and one net north-south amount.

Problem
A claw crane lifts a prize \(7\) cm with each press of the button, but between presses the prize slips back \(3\) cm. The prize must rise \(25\) cm to clear the bin wall, and once it clears, it is out, no more slipping. Draw the height after each press. How many presses does it take?
Show a hint
  • Track the peak height at each press. Press one peaks at \(7\), then each later press peaks \(4\) higher than the last, since \(7\) up and \(3\) back gain \(4\) per full cycle.
  • The story ends the moment a peak reaches \(25\). Do not subtract the slip after the winning press.
Show the full solution

The peaks climb \(7, 11, 15, 19, 23, 27\), gaining \(4\) per full cycle. The fifth peak of \(23\) is still short of the wall, and the sixth peak of \(27\) clears it, so it takes \(\boxed{6}\) presses.

Dividing \(25\) by the net gain of \(4\) misses that the winning press never gives back its \(3\) cm.

Problem
Four swimmers line up for a relay in positions \(1\) through \(4\). Kai swims immediately after Lena. Mira swims somewhere before Lena. Jo does not swim first, and Jo swims somewhere before Kai. Draw four slots and place the swimmers. Which position does Jo swim?
Show a hint
  • Kai immediately after Lena glues them into a block, Lena then Kai. Try the block in positions \(2\)-\(3\) and \(3\)-\(4\), since Mira must fit before Lena.
  • If Lena and Kai take \(2\) and \(3\), the only slot before Kai that is not first is taken by Lena. Push the block later and see what opens up.
Show the full solution

Kai right after Lena glues them into a block, Lena then Kai. If that block sits at \(2\) and \(3\), Mira takes \(1\) and Jo has no slot left that is before Kai and not first. So the block sits at \(3\) and \(4\), Mira takes \(1\), and Jo takes \(\boxed{2}\). The order Mira, Jo, Lena, Kai fits every clue.

Four drawn slots turn each clue into a physical constraint you can test in seconds, instead of a sentence you have to keep rereading.

Problem
CoralPalmBellDriftEbb
Five islands are served by ferries running both directions on these routes only. Coral to Palm, Palm to Bell, Bell to Coral, Bell to Drift, and Drift to Ebb. What is the smallest number of ferry rides that gets a traveler from Coral to Ebb?
Show a hint
  • Only Drift connects to Ebb, so any trip to Ebb must arrive through Drift.
  • Find the fastest way from Coral to Drift, then add the final ride.
Show the full solution

Ebb connects only to Drift, and Drift connects only to Bell, so the trip has to finish Bell, then Drift, then Ebb. Coral reaches Bell directly, so Coral to Bell to Drift to Ebb takes \(\boxed{3}\) rides, and nothing shorter works.

Drawn as dots and lines, the dead-end branch out to Ebb is obvious in a way a written route list never is.

Problem
3 chords, 7 regions
A straight chord drawn across a circle splits it into \(2\) regions. Two chords can make as many as \(4\) regions, and three chords, drawn so every pair crosses inside the circle at a fresh point, make \(7\), as shown above. Keep drawing and counting. What is the greatest number of regions five chords can make?
Show a hint
  • List the maximum counts so far, \(2, 4, 7\), and look at the jumps between them. Each new chord adds one more region than the chord before it added.
  • The jumps run \(2, 3, 4, 5\), so the fourth chord brings the count to \(11\), and the fifth continues the pattern.
Show the full solution

The counts climb \(2, 4, 7\), with jumps of \(2\), then \(3\). A new chord that crosses \(k\) old chords passes through \(k + 1\) regions and splits each one, so the fourth chord adds \(4\) and the fifth adds \(5\).

$$2, \; 4, \; 7, \; 11, \; \boxed{16}$$

Drawing the small cases gave the numbers, and counting crossings explains why each jump is one bigger than the last.

Practice these ideas

Practice
A parade float rolls \(12\) blocks west, \(5\) blocks north, and \(12\) blocks east. Sketch the route. How many blocks is the float from where it started?
Show the solution

West \(12\) and east \(12\) cancel, leaving only the \(5\) blocks north.

$$\boxed{5}$$

Practice
A kayaker paddles \(9\) km east, \(4\) km west, and \(12\) km north. Find the straight-line distance in km back to the launch point.
Show the solution

The trip nets to \(5\) km east and \(12\) km north, a right triangle with hypotenuse

$$\sqrt{5^2 + 12^2} = \sqrt{169} = \boxed{13}$$

Practice
In an elevator game, each round moves the marker up \(6\) floors and then back down \(2\). The marker starts at floor \(0\) and wins the moment it touches floor \(22\), even mid-round. Draw the floor level round by round. In which round does the marker win?
Show the solution

The round peaks run \(6, 10, 14, 18, 22\). The fifth peak touches \(22\) exactly, and the game ends there, no slide back.

$$\boxed{5}$$

Practice
Four friends finish a race. Nia beats Owen. Pia finishes immediately behind Nia. Owen does not finish last. Quinn is also racing. Draw the four finishing slots. In which place does Owen finish?
Show the solution

With the Nia-Pia block at positions \(1\) and \(2\), Owen must finish after Nia but not last, which forces Owen into \(3\) and Quinn into \(4\). With the block at \(2\) and \(3\), Owen would have to take \(4\), which the clue forbids. So the order is Nia, Pia, Owen, Quinn.

$$\boxed{3}$$

Practice
A jeweler cuts a long chain into \(6\) sections, and each cut takes \(2\) minutes. How many minutes does the job take?
Show the solution

Six sections come from \(5\) cuts, and \(5 \times 2 = \boxed{10}\) minutes.

Practice
Twenty-five trees stand in a straight row with equal gaps of \(6\) meters between neighbors. How many meters is it from the first tree to the last?
Show the solution

Between \(25\) trees sit \(24\) gaps of \(6\) meters each,

$$24 \times 6 = \boxed{144}$$

Practice
Two boards, each \(45\) cm long, are joined with an overlap to form a shelf \(78\) cm long. Draw the boards. How many centimeters long is the overlap?
Show the solution

Without overlap the boards would span \(90\) cm, and the shelf lost \(90 - 78 = 12\) cm to the doubled section.

$$\boxed{12}$$

Practice
A subway map lists these two-way lines between six stations. A to B, B to C, C to D, D to E, B to E, and E to F. Draw the network. What is the least number of rides from A to F?
Show the solution

The drawing shows F hanging off station E alone. The quickest way to E from A is A to B, then the direct B to E line, and then E to F.

$$\boxed{3}$$

The B to E shortcut is nearly invisible in the written list and impossible to miss in the picture.

Practice
Continuing the circle-and-chords pattern from the lesson, what is the greatest number of regions six chords can create?
Show the solution

The jumps climb \(2, 3, 4, 5, 6\), so six chords reach

$$16 + 6 = \boxed{22}$$

Practice
A rectangular garden plot measures \(50\) meters by \(30\) meters. A gardener plants a flag at one corner and then every \(10\) meters around the entire perimeter. How many flags get planted?
Show the solution

The perimeter is \(2(50 + 30) = 160\) meters, which splits into \(160 \div 10 = 16\) gaps. The path is a loop, so the sixteenth gap ends exactly where the first flag already stands, and flags equal gaps at \(\boxed{16}\).

On a straight path flags would outnumber gaps by one, so line or loop is the whole question in fencepost problems.