Choosing Coordinates That Kill the Problem
Most geometry puzzles have one coordinate placement that turns three pages of trigonometry into two lines of algebra. The skill isn't computing — it's noticing which point to put at the origin before you compute anything.
A square has side length 4. A point is chosen so that its distances to two adjacent corners of the square are 3 and 5. What is the distance from to the corner diagonally opposite the one nearest it — or, more concretely, can even exist, and where?
Before reading on, notice your instinct: are you reaching for the Pythagorean theorem in your head, or trying to draw it and eyeball an answer? The point of this page is to replace both instincts with one deliberate first move.
The one decision that matters most
Coordinate geometry turns a picture into algebra, but the same picture can be assigned coordinates in infinitely many ways — and almost all of them produce messy expressions. The single highest-leverage decision in the entire problem is where to put the origin and how to orient the axes, made before writing a single equation. Good placements share a pattern: put the origin at a point with the most constraints touching it (a right angle, a center of symmetry, a shared vertex), and align an axis along a side or a line of symmetry so that as many coordinates as possible become 0.
For the square puzzle: put the corner nearest at the origin, with the two sides of the square running along the positive - and -axes. That single choice makes both adjacent corners land on the axes with clean coordinates — corner , corner , corner , and the far corner — instead of some arbitrary rotated mess.
Solving the puzzle
With , , and the unknown point: "distance from to is 3" means . "Distance from to is 5" means .
Subtract the first equation from the second to eliminate in one step — this is exactly the payoff of the coordinate choice, since both equations share the same term:
So , and from : , giving (taking the point inside/above the square). — which sits exactly on side , three units up from . That's already a clean, checkable answer: is a specific point on the square's edge, not floating somewhere in open space.
Distance to the far corner :
Answer: . The whole solution was two equations, one subtraction, and one distance formula — no trigonometry, no case-drawing, because the coordinate choice did the hard work before the algebra started.
Before writing any equation, choose the origin and axis directions so that the point carrying the most constraints sits at and as many other named points as possible land on an axis. Every constraint that becomes "coordinate equals zero" is one less variable you have to carry through the algebra.
A second example: a triangle's median
Triangle has , , and the angle at is 90°. Find the length of the median from to the midpoint of .
The right angle is the most-constrained point, so put it at the origin with the legs on the axes: , , — the right angle becomes automatic (the axes are perpendicular by construction, so there's nothing left to verify). The midpoint of is .
Notice this instantly confirms a classical fact — the median to the hypotenuse of a right triangle equals half the hypotenuse (, and indeed ) — a fact that's genuinely fiddly to prove with pure angle-chasing but falls out of coordinates in one line, because putting the right angle at the origin made the right-angle condition free instead of something to prove.
When a problem hands you a right angle, a center of symmetry, or a shared vertex between several given distances, that point is almost always the correct origin. When nothing stands out, put one full side of the figure on the -axis with its left endpoint at the origin — it's a safe default that kills at least two coordinates.
The generalizable technique
The habit — spend ten seconds choosing coordinates before writing equations, rather than defaulting to whatever orientation the picture was drawn in — is what separates a two-line coordinate solution from a three-page trigonometric slog on the same problem. It generalizes directly to physics-flavored quant puzzles (choosing a reference frame that kills a component of motion), to portfolio geometry (rotating axes to align with principal components so covariance terms vanish), and to any optimization where a smart change of variables turns a coupled system into an uncoupled one. The geometry is almost never the hard part; the coordinate choice is.
Related concepts
Practice in interviews
Further reading
- Engel, Problem-Solving Strategies (ch. 3, Coordinates)
- Coxeter & Greitzer, Geometry Revisited