Left and Right Turns on a Grid
Problem
In an infinite city, all streets run either east-west or north-south along straight lines; the intersections are called lattice points. A person starts at some lattice point, passes through each lattice point at most once, and finally returns to the starting point. Given that they turned left times, determine all possible numbers of right turns.
Answer
Solution
| Difficulty | 7/10 |
|---|---|
| Topics | combinatorics, plane geometry, Casework, Symmetry |
Whiteboard
Your sketch is saved only in this browser. To share it, export your drawing as an image (whiteboard menu → Export as → PNG), then upload that image in the comments below.
Discussion
Ask questions, share alternate solutions, and use LaTeX freely.
Log in to join the discussion.
No comments yet.