Show solutionHide solution
Question 3
Signed changes cancel; traveled lengths accumulate
A walker follows a straight east-positive path through the positions in the order A, B, C, D. Initially assume the walker never reverses within a leg between successive listed stops.
Diagram shown in the original SVG worksheet.
Distance traveled is the accumulated length of the actual path, regardless of direction. For a leg with no reversal it equals .
Find each signed leg displacement, the total displacement, and total distance traveled.
Show algebraically why adding signed leg displacements gives the endpoint displacement. Explain why applying an absolute value before adding gives a different result here.
Let be the accumulated eastward length and the accumulated westward length. Find both and explain why the excess of total distance over the positive net displacement equals .
Now remove the no-reversal-within-a-leg assumption, keeping only the ordered stop observations. Which result remains exact, and what can be said about total distance? Give a longer compatible route.
Question 3 - Solution
Signed changes cancel; traveled lengths accumulate
Diagram shown in the original SVG worksheet.
(a) Keep the signs until the requested quantity is clear.
The leg displacements are . Therefore The net change is eastward; the traveled length includes the westward leg too.
(b) Internal endpoint coordinates cancel in a signed sum.
The repeated intermediate coordinates cancel. Absolute values remove the opposite signs that permit this cancellation: they count lengths rather than net changes. Thus is not the same as the 23 m path length.
(c) Opposing travel is counted twice in the excess.
Here and . In general, For this eastward net change, . Each metre westward adds path length and also offsets a metre of eastward progress.
(d) Endpoints fix displacement even when the path is hidden.
The total displacement remains . The sum 23 m becomes a lower bound on distance, since any continuous path between successive stops is at least their separation. For example, during the first leg the walker could go from to and then back to before completing the listed later legs. The distance becomes . Without an extra constraint there is no finite upper bound on compatible traveled length.