A deceptively simple question — what is the probability that a random chord of a circle is longer than the side of its inscribed equilateral triangle? — has three different correct answers depending on what 'random' means.
In 1889, Joseph Bertrand posed a deceptively simple question:
A chord is drawn at random inside a circle. What is the probability that it is longer than the side of the inscribed equilateral triangle?
Three equally natural ways to answer give three different probabilities: , , and . Each is mathematically correct. The paradox lives in the word random.
The Setup
Fix a circle of radius . The inscribed equilateral triangle has side length . A chord of the circle is longer than this when it passes close enough to the centre.
Precisely: a chord is "long" (longer than ) if and only if its midpoint lies within distance of the centre.
Now: how do you pick a chord at random?
Method 1 — Random Endpoints P = 1/3
Pick two points independently and uniformly on the circumference. Connect them.
By rotational symmetry, fix one endpoint and let the other vary. The chord is longer than the triangle's side when the arc between the two points subtends an angle between and — a fraction of the circle. Wait, that gives , not .
Let me be more careful. The inscribed equilateral triangle has vertices apart. The chord from a fixed point is longer than the triangle's side when the second point falls in the arc opposite to it — specifically the middle third of the circle, spanning out of . That gives:
Method 2 — Random Radius Point P = 1/2
Pick a random radius (direction) and then a random point uniformly along that radius. Draw the chord through that point, perpendicular to the radius.
By symmetry we may fix the radius direction. The point is at distance from the centre, where . The perpendicular chord at distance has half-length , so full length .
The chord is longer than when , i.e. when . That event has probability:
Method 3 — Random Midpoint P = 1/4
Every chord has a unique midpoint inside the circle (the diameter has midpoint at the centre). Pick a point uniformly at random inside the circle and use it as the midpoint of the chord.
The chord is long when its midpoint lies within of the centre — inside an inner circle of radius . The probability is the ratio of areas:
The Playground
Three valid methods. Three different probabilities. See them diverge in real time — each panel accumulates chords drawn by its own method.
The yellow triangle is the inscribed equilateral triangle. The dashed inner circle in Method 3 shows the region where midpoints of long chords fall.
Three Ways to Pick a “Random Chord”
Method 1
Random Endpoints
Two uniform points on the circumference
Method 2
Random Radius
Uniform point along a random radius
Method 3
Random Midpoint
Uniform point inside the circle as midpoint
All three methods are geometrically valid — yet they produce different probabilities. That's the paradox.
The visual difference is immediate. Method 2 (Random Radius) produces many long chords — nearly half the screen is green. Method 3 (Random Midpoint) produces the fewest. Same circle. Same triangle. Same question. Different answers.
Toggle the ⬤ Midpoints view to see where the chord midpoints fall:
- Method 1 — midpoints cluster near the boundary. Short chords (endpoints close together) have midpoints far from the centre.
- Method 2 — midpoints cluster near the centre. Uniform in radius packs more points into small annuli.
- Method 3 — midpoints are uniformly spread across the disk.
Why Density Matters: A Polar Coordinates Warm-Up
Before resolving the paradox, here is a concrete reason to care about where points fall when you sample "uniformly."
Imagine placing points evenly spaced in angle on two concentric circles — one of radius , one of radius . Both carry exactly points. Yet the spatial gap between adjacent points is , which grows linearly with . Double the radius, double every gap. The angular distribution is uniform, but the spatial distribution is not.
Same N Points, Different Radius → Different Density
Both circles have the same 20 points, evenly spaced in angle θ.
The arc between adjacent points is 2πr / N — so it scales with r.
Doubling the radius doubles the gap. The density (points per unit arc) is N / (2πr) — halving as r doubles. Numerically "even" in angle, but spatially sparser at larger radii.
This is exactly the issue with Method 2. Sampling a point uniformly along a radius () gives every small interval the same number of midpoints. But a thin annulus at radius has area — growing with — so the density per unit area is : highest at the centre, thinning toward the boundary. That clustering in the midpoints view is not an artifact; it is the direct consequence of the sampling method.
Density Functions: The Precise Language
Each method secretly defines a probability density function (PDF) for the chord's midpoint distance from the centre. That PDF determines the probability.
Method 1 (Random Endpoints):
Diverges as — density is highest near the boundary.
Method 2 (Random Radius Point):
Uniform in , but not uniform in area ( per unit area toward the centre).
Method 3 (Random Midpoint):
The only density that is uniform in area. The cleanest scatter in the midpoints view.
Each probability follows directly from integrating its density from to (the long-chord condition):
The three answers are not in conflict — they are consequences of three different densities on the same geometry.
Try It: Override the Density
If the three methods all produced the same density, they would give the same probability. You can verify this in the playground below. Use the Density override panel to force all three panels to sample from , , or regardless of their geometric method. All three converge to the same value. Or type any expression in r and R into the Custom f(r) input to define your own density and see what probability it implies.
Three Ways to Pick a “Random Chord”
Method 1
Random Endpoints
Two uniform points on the circumference
Method 2
Random Radius
Uniform point along a random radius
Method 3
Random Midpoint
Uniform point inside the circle as midpoint
All three methods are geometrically valid — yet they produce different probabilities. That's the paradox.
The same probability space — chords of a circle — admits multiple natural PDFs. Choosing a PDF is equivalent to choosing a sampling method, and that choice alone determines every downstream probability.
Conclusion
The Bertrand paradox shows that "pick a random chord" is not a well-posed question. Each method is a choice of parametrization of the sample space — by endpoint angles, by radius, by midpoint coordinates — and a uniform distribution over one parametrization is non-uniform over another. The geometry is the same. The triangle is the same. What differs is the density.
This is not a pathology of one contrived example. Whenever you write "pick a random ," you are implicitly choosing a probability measure on the space of all 's. Different choices are valid; they just give different answers. The Bertrand paradox makes that invisible choice visible.
Further Reading
- Joseph Bertrand, Calcul des probabilités (1889) — the original source
- E. T. Jaynes, "The Well-Posed Problem" (1973) — argues Method 2 is the unique scale-and-translation-invariant solution
- Wikipedia: Bertrand paradox (probability)
Related Articles
The Fourier Transform: From Sines to Signals
A visual and mathematical journey through one of the most beautiful ideas in all of mathematics — decomposing any signal into its frequency components.
The Abelian Sandpile: A Group Hiding in a Pile of Sand
The Bak–Tang–Wiesenfeld sandpile model (ASM) is a deceptively simple cellular automaton that conceals a rich algebraic structure — an abelian group whose identity element is a non-trivial fractal-like configuration.
Why Tuning a Piano is Mathematically Impossible
Perfect harmony is a mathematical impossibility. Here's the beautiful, maddening reason why — and how piano tuners have learned to live with it.