Breaking a Stick Into a Triangle
Break a stick at two random points into three pieces — what's the chance they form a triangle? The puzzle rewards translating a geometry question into a picture of the sample space itself.
Prerequisites: Choosing Coordinates That Kill the Problem
Take a stick of length 1. Pick two points on it uniformly at random and break the stick at both — you now have three pieces. What's the probability that those three pieces can be arranged into a triangle?
Try it before reading on. The instinct is to guess something close to a half, or to reach for calculus. Neither is needed — the whole problem collapses once you stop thinking about "pieces of a stick" and start thinking about a single point on a two-dimensional map.
Setting up the picture
Call the two break points and , both drawn uniformly from . Every possible pair is a point inside the unit square, and because and are independent and uniform, that square is the sample space — every point in it is equally likely, so a probability is just an area.
Assume for a moment (you'll double back for the symmetric case). Then the three pieces have lengths , , and . Three segments form a triangle exactly when no one piece is longer than the sum of the other two — equivalently, no piece exceeds half the total length. With total length 1, that means all three pieces must be shorter than .
Turning "can these three lengths form a triangle" into "is this point inside a region of the square" is the whole trick. Once the condition on and is written down, the probability is just (area of the good region) ÷ (area of the square).
Working the three inequalities
Write out the three no-piece-too-long conditions for :
The first says the left piece is short. The third rearranges to : the right piece is short. The middle one, , says the middle piece is short.
Plot these three lines inside the triangle (half the unit square, since we assumed ). Shading the region where all three hold carves out a smaller triangle in the middle of that half-square. Working the vertices out — the lines , , and meet the boundary at , , and — that inner triangle has area exactly of the area of the half-triangle (which itself has area ), so its area relative to the full unit square is .
Doubling for the symmetric case gives another region of area , for a total good area of out of the full square's area of 1.
Only one time in four does a randomly broken stick make a triangle — most breaks produce one piece that's simply too long relative to the other two, because a uniform break point has a real chance of landing very close to one end.
The transferable technique
Whenever a puzzle involves several independent uniform random quantities and a geometric condition on them (triangle formation, whether points fall within a distance, whether a sum stays under a bound), the move is the same: let the variables be coordinates, draw the region satisfying the condition, and read off a probability as a ratio of areas or volumes. This turns algebra-heavy conditional reasoning into a single picture, and it's the standard opening move for the whole family of stick-breaking, meeting-time, and random-point puzzles that show up in quant interviews.
When a puzzle gives you two or more independent uniform variables, sketch the square (or cube) immediately — most of these problems are solved the moment the picture is right, well before any integral is needed.
Related concepts
Practice in interviews
Further reading
- Mosteller, Fifty Challenging Problems in Probability