Maths Olympiad Prep

Library / HMMT Invitational Competition /1 of 2

HMMT Invitational Competition

Geometry Difficulty 5.2 AIME, harder Prove it United States

Problem:

Theseus starts at the point (0,0)(0,0) in the plane. If Theseus is standing at the point (x,y)(x, y) in the plane, he can step one unit to the north to point (x,y+1)(x, y+1), one unit to the west to point (x−1,y)(x-1, y), one unit to the south to point (x,y−1)(x, y-1), or one unit to the east to point (x+1,y)(x+1, y). After a sequence of more than two such moves, starting with a step one unit to the south (to point (0,−1)(0,-1)), Theseus finds himself back at the point (0,0)(0,0). He never visited any point other than (0,0)(0,0) more than once, and never visited the point (0,0)(0,0) except at the start and end of this sequence of moves.
Let XX be the number of times that Theseus took a step one unit to the north, and then a step one unit to the west immediately afterward. Let YY be the number of times that Theseus took a step one unit to the west, and then a step one unit to the north immediately afterward. Prove that ∣X−Y∣=1|X-Y|=1.

Solution

Solution:

The path Theseus traces out is a closed, non-self-intersecting path in the plane. Since each move is along a line segment, the path forms the boundary of a polygon in the plane. WLOG this polygon is traversed counterclockwise (i.e. with the interior of the polygon always on Theseus's left); the argument in the clockwise case is analogous, with a sign flip.
Let i=0i=0 correspond to the direction east, i=1i=1 correspond to north, and so forth. For 0≤i≤30 \leq i \leq 3 and j=i±1j=i \pm 1 let XijX_{ij} be the number of times Theseus switches from going in direction ii to going in direction jj (where indices are taken  mod  4\bmod\ 4). So, X=X1,2X=X_{1,2}, Y=X2,1Y=X_{2,1}. We have the following relations among the XijX_{ij}:
The sum n=∑Xi,jn=\sum X_{i, j} is the number of vertices of the polygon. The sum of the interior angles of the polygon is thus π(n−2)\pi(n-2). Each counterclockwise turn contributes π2\frac{\pi}{2}, and each clockwise turn contributes 3π2\frac{3 \pi}{2} to this sum. The number of the former is counted by ∑Xi,i+1\sum X_{i, i+1}, and the latter by ∑Xi+1,i\sum X_{i+1, i}. So, π(n−2)=π2∑Xi,i+1+3π2∑Xi+1,i=πn+π2∑(Xi+1,i−Xi,i+1)\pi(n-2)=\frac{\pi}{2} \sum X_{i, i+1}+\frac{3 \pi}{2} \sum X_{i+1, i}=\pi n+\frac{\pi}{2} \sum\left(X_{i+1, i}-X_{i, i+1}\right), which gives ∑(Xi,i+1−Xi+1,i)=4\sum\left(X_{i, i+1}-X_{i+1, i}\right)=4.
Finally, observe by starting from the middle of any edge that since we start and end in the same direction, the number of times we turn into direction ii must equal the number of times we turn out of it. So Xi,i+1+Xi,i−1=Xi+1,i+Xi−1,iX_{i, i+1}+X_{i, i-1}=X_{i+1, i}+X_{i-1, i}, which rearranges to give Xi,i+1−Xi+1,i=Xi−1,i−Xi−1,iX_{i, i+1}-X_{i+1, i}=X_{i-1, i}-X_{i-1, i}. So 4=∑(Xi,i+1−Xi+1,i)=4(X1,2−X2,1)=4(X−Y)4=\sum\left(X_{i, i+1}-X_{i+1, i}\right)=4\left(X_{1,2}-X_{2,1}\right)=4(X-Y).
So X−Y=1X-Y=1 as desired.

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.