Bertrand's Paradox: What 'Random' Actually Means

In 1889, the French mathematician Joseph Bertrand posed a question that looks like it should have a single, well-defined answer:

Pick a random chord of a circle. What is the probability that the chord is longer than the side of the equilateral triangle inscribed in that circle?

Sounds straightforward. A chord is a line segment with both endpoints on the circle. The inscribed equilateral triangle has sides of a specific length. We just want the probability that the random chord is longer than that.

Bertrand then showed that three reasonable methods of generating a “random” chord give three different answers: 1/2, 1/3, and 1/4. Each is correct under its own definition. The paradox isn’t that one calculation is wrong — it’s that the question itself is ambiguous in a way that’s easy to miss.

The paradox shaped 20th-century probability theory. It motivated mathematicians to be precise about what “random” actually means, eventually leading to the measure-theoretic foundations of probability we use today. It’s also a beautiful illustration that intuition about continuous randomness can be deeply misleading.

This article walks through the three methods, explains why they disagree, and shows what mathematicians learned from the disagreement.

Setup

The inscribed equilateral triangle has a known geometric property. If the circle has radius $r$ , the triangle’s side length is $r\sqrt{3} \approx 1.732 r$ .

A chord is longer than the triangle’s side exactly when its midpoint is closer to the center than $r/2$ . This is a clean geometric criterion — and the three methods we’ll see differ in how they distribute that midpoint randomly.

Method 1: Random endpoints — answer 1/3

Pick the chord by choosing two independent uniform random points on the circle. Say the first point is at the top of the circle (we can always rotate to make this true without loss of generality). Then the second point is uniformly distributed around the circle.

The chord is longer than the triangle’s side exactly when the second point lies in the arc opposite to the first, between the two vertices of the inscribed triangle that aren’t the first point.

That arc is one-third of the full circle. So the probability is 1/3.

Method 2: Random radius — answer 1/2

Pick a random radius of the circle (uniform direction), then pick a random point uniformly along that radius. The chord is the one perpendicular to the radius at that point.

The chord is longer than the triangle’s side exactly when the point is less than $r/2$ from the center. Since the point was chosen uniformly on a radius of length $r$ , the probability is $r/2 \div r =$ 1/2.

Method 3: Random midpoint — answer 1/4

Pick a random point uniformly inside the circle. That point is the midpoint of a uniquely-determined chord (perpendicular to the radius through the point).

The chord is longer than the triangle’s side exactly when the midpoint lies inside the circle of radius $r/2$ centered at the same center. The area of that smaller circle is $\pi(r/2)^2 = \pi r^2 / 4$ . The area of the full circle is $\pi r^2$ . The probability is 1/4.

So which is right?

Each calculation is mathematically correct. Each corresponds to a different probability distribution on the space of chords. The three methods produce different distributions of midpoints inside the circle:

Method 1 (random endpoints): midpoint distribution is heavily concentrated near the center.
Method 2 (random radius): midpoint distribution is uniform along radii but not over area.
Method 3 (random midpoint): uniform over area.

When you say “pick a random chord,” you have to specify which distribution. Without that, the question is ambiguous. The paradox isn’t a contradiction in mathematics — it’s a demonstration that “random” in continuous spaces requires more specification than discrete intuition suggests.

The deeper lesson

Bertrand’s paradox shocked late-19th-century probability theorists. The classical view, going back to Laplace, was that “uniform” or “equally likely” was a natural concept that didn’t need careful definition. Bertrand showed it does.

The resolution came in the 20th century with measure-theoretic probability, formalized by Andrey Kolmogorov in 1933. In this framework, “random” always means “distributed according to a specified probability measure.” You can’t talk about randomness without first specifying the measure. Bertrand’s three methods correspond to three different measures on the space of chords, and there’s no canonical choice between them.

This abstraction may seem like a technicality, but it’s foundational. Modern probability — including the Law of Large Numbers, the Central Limit Theorem, Bayesian inference, and stochastic processes — all rest on measure theory.

Where this matters in practice

The Bertrand-style ambiguity appears in many practical settings.

Bayesian priors. When you want a “non-informative” prior on a continuous parameter, you have to choose a distribution. Different parametrizations give different “uniform” priors. The classic example: a uniform prior on $\theta \in [0, 1]$ is not the same as a uniform prior on $\theta^2$ — even though both are “uniform” in some sense. Bayesian statisticians have developed several principled approaches (Jeffreys prior, reference prior) but no universal answer.

Particle physics simulations. When generating “random” particle trajectories, the chosen sampling distribution matters. Different parametrizations of the same physical situation give different Monte Carlo results.

Financial modeling. “Random walks” in stock prices depend on which quantity (price, log-price, percentage return) is taken as the underlying random variable.

Geometric probability. Many problems involve “random” objects in geometric configurations. Bertrand-like ambiguity is the norm, not the exception. Modern integral geometry handles this systematically.

Other geometric probability paradoxes

Bertrand’s chord paradox isn’t the only example.

The two-envelopes paradox: you’re given two envelopes containing money, one with twice the amount of the other. You pick one. The naive expected-value calculation says you should always switch — but you’d reach the same conclusion after switching. The resolution requires careful specification of the prior distribution on the money amounts.

The Sleeping Beauty problem: a probabilistic puzzle about credences and indexical information. Different reasonable analyses give 1/2 or 1/3. Like Bertrand’s paradox, the resolution requires specifying assumptions that the problem leaves ambiguous.

Random points on a triangle: how do you pick a “random” point on a triangle? Uniform in the triangle, or uniform on the vertices weighted by some measure, or… again, multiple natural choices.

What Bertrand’s paradox teaches

The deepest lesson is that randomness in continuous spaces requires explicit specification. Discrete uniform distribution is unambiguous (each of $n$ outcomes has probability $1/n$ ). Continuous “uniform” distributions need a measure to be defined relative to — and different reasonable measures give different answers.

For students of mathematics, Bertrand’s paradox is one of the cleanest demonstrations of why measure theory is the right foundation for probability. Without it, probability questions can be ambiguous in subtle but consequential ways.

For working scientists, the lesson is to specify your distribution carefully. When someone says “I picked random samples,” ask: random with respect to what measure? The answer often matters more than it seems.

For everyone else, Bertrand’s paradox is a useful reminder that mathematical intuition can fail in continuous settings even when discrete intuition works. The same problem can have multiple correct answers depending on how you frame the random sampling. There’s no contradiction — just ambiguity in the question.

The paradox is now over 130 years old. Its specific example (chords of a circle) still appears in probability courses as a cautionary tale. The general lesson — that “random” needs explicit specification in continuous settings — has been absorbed deep into modern mathematics and statistics.

Joseph Bertrand showed in 1889 that even a simple-sounding question about geometric probability could have three valid answers. The mathematical community spent 50 years figuring out exactly what to do about it. The answer they arrived at — measure-theoretic probability — is the framework underlying every modern statistical analysis, every Monte Carlo simulation, every machine-learning algorithm that uses random sampling.

One paradox; one century of mathematics; one new foundation. That’s how good paradoxes work in mathematics: not by being unsolvable, but by forcing the field to develop the right concepts to dissolve them.

Frequently asked

Is one of the three answers 'correct'?

No — and that's the whole point of the paradox. Each answer is mathematically valid; they correspond to different ways of generating a 'random' chord. The lesson is that 'random' is not a self-evident concept. You have to specify the probability distribution being used. Without that specification, the question is ambiguous.

Did Bertrand really pose this paradox?

Yes. Joseph Bertrand introduced it in his 1889 book Calcul des Probabilités, alongside several other paradoxes designed to show that naively-stated probability problems can be ambiguous. The paradox sparked debates that lasted decades and helped motivate the modern, measure-theoretic foundation of probability.

Does this matter in practice?

Yes. Whenever you talk about a 'uniform' distribution over a continuous space, you have to specify the underlying measure. The same physical setup can be 'uniform' in different parametrizations, giving different answers. This issue arises in Bayesian priors, in particle physics simulations, in financial modeling — anywhere a continuous uniform distribution is invoked.