Why Random Triangles Catch the Circle's Center ¼ of the Time
Drop three random points on a circle and the triangle contains the center exactly a quarter of the time. Two proofs: an honest average, then two coins wearing a geometry costume.
Drop three points on a circle, uniformly and independently, and join them into a triangle. Sometimes the triangle contains the circle’s center. Usually it doesn’t. Run the experiment a million times with a fixed seed, as the video does, and the tally lands on 25.06 %. The true answer is exactly one quarter, and the way you get there is one of the best arguments in elementary probability.
Three points chosen uniformly and independently on a circle form a triangle that contains the center with probability exactly .
Freeze two points, watch the third
Three moving points is two too many. So pin and wherever they happen to be and slide around the rim. The positions where the triangle catches the center are not scattered. They form a single arc: the arc directly opposite and , the one you get by drawing both diameters and looking across the circle.
The reason is a half-circle argument. If lands anywhere else, all three points fit inside one half of the circle, and the diameter bounding that half separates the center from the triangle. If lands on the opposite arc, no half-circle can hold all three points, so the triangle has to straddle the middle. Every miss hides in a half-circle. That is the whole geometric content of the problem.
Averaging the arc
Since is uniform, the probability of a catch, given the first two points, is just the opposite arc’s share of the rim. That share moves: it matches the arc between and , which after spinning to the top is uniform between 0 and half the circle. The average of a quantity spread evenly between 0 and is . Done, honestly, with one small integral hidden in the word “average”.
Two coins in a geometry costume
A quarter is a suspiciously round answer for an average over infinitely many configurations. When that happens, you usually computed a simple thing the hard way. Here is the re-description that exposes it. To pick a uniform point, you can first draw a random diameter, then flip a fair coin for which end you keep. Do that for and , and place before touching the coins.
Freeze the frame. Two diameters cut the rim into four arcs, and sits in one of them. The two coins produce four equally likely triangles, and the winning condition from Fig. 1 says a triangle catches the center exactly when the kept endpoints sit opposite ’s arc. Flip either coin and the winning arc jumps to a different one of the four. So the four outcomes claim the four arcs, one each, and exactly one outcome wins. In every configuration:
No averaging, because there is nothing left to average: the conditional answer is the same constant everywhere. The 4 was never geometric. It is two fair coins.
The same quarter counts acute triangles
There is a bonus hiding in the half-circle picture. An inscribed triangle contains the center exactly when every arc between neighboring corners stays under half a turn, and by the inscribed angle theorem each corner sees the opposite arc at half its width. Arcs under a half turn mean angles under 90°. So “contains the center” and “acute” are the same property in different clothes: a random inscribed triangle is acute with probability , right-angled with probability zero (that boundary case is Thales’ theorem), and obtuse the remaining three quarters of the time. Most random triangles are lazy, sprawled things.
One dimension up
The coin argument does not know what dimension it lives in. Four random points on a sphere, one tetrahedron, same question: park the fourth point, draw three random diameters, flip three coins. Eight outcomes, one winner, so the answer is — a result that once sat at the hard end of a famous competition paper. On the circle the pattern continues for points:
Feed it and the quarter comes back. Feed it and the whole thing collapses to a coin flip. Finding the four coins inside that one-half is a good exercise, and the video ends by leaving it to you. If you enjoy chance colliding with geometry, the widest-street view of support vector machines scratches a related itch: there too, almost all of the configuration turns out not to matter.
Comments · 0
Be the first to comment.