Bertrand’s paradox

How likely is a random chord to be longer than the side of an inscribed equilateral triangle?

Random endpoints

Choose two points independently and uniformly on the circumference, then join them.

Exact probability
⅓
Sample
—

Random radius

Choose a radius at an angle uniform from 0° to 360°, then a point uniformly along that radius. Draw the chord through the point, perpendicular to the radius.

Exact probability
½
Sample
—

Random midpoint

Choose a point uniformly over the area of the disc and use it as the chord’s midpoint.

Exact probability
¼
Sample
—

The dashed circle has radius R/2. A chord is longer than √3 R exactly when its midpoint lies inside it.

Threshold and distributions
Random endpoints
Random radius
Random midpoint

Sample frequencyExact bin probabilityDistance from centre / R · common scales

Model and methodology

Three probability measures

“Choose a chord at random” leaves the sampling procedure unspecified. All three procedures are rotationally symmetric, yet assign different probabilities to the chords. A physical experiment or further assumptions may select a measure; rotational symmetry alone does not.

The geometry

A chord with midpoint distance d has length L = 2√(R² − d²). The triangle has side √3 R, so L > √3 R exactly when d < R/2. All chords are solid. Chords and Midpoints use identical marks for both length classes; Colour by length uses teal for longer chords and ochre for shorter or equal chords. The sample percentage beneath each diagram gives the proportion of longer chords. The newest chord is emphasised; M labels its midpoint in the construction view.

Uniform midpoint density and uniform chord coverage differ. The random-midpoint method distributes points uniformly over area; the random-radius method gives uniform chord coverage on average. Overlapping translucent strokes darken and eventually saturate, so the drawing is not a calibrated density map.

Sampling and exact answers

Random endpoints uses two independent angles uniform on [0, 2π). With one endpoint fixed by rotational symmetry, the other must fall on one third of the circumference: probability 1/3.

Random radius uses an angle uniform on [0, 2π) and an independent distance d uniform on [0, R]. Half the distances satisfy d < R/2: probability 1/2.

Random midpoint uses a uniform angle and d = R√U, with U uniform on [0, 1). The square root makes the distribution uniform over area. The inner disc occupies one quarter of that area: probability 1/4. A midpoint exactly at the centre uses the sampled orientation.

For threshold tR, let q = √(1 − t²/4), where 0 ≤ t ≤ 2. The exact probabilities are 2 arcsin(q)/π, q, and q², respectively. Changing the threshold reclassifies the existing sample.

Finite samples and display limits

Each experiment starts empty and uses a separate, reproducible pseudorandom stream. Draw chords adds 180 samples per second while the page is visible; Step adds one per method. Reset clears the samples and restores the initial view and triangle threshold. Reduced motion groups updates once per second.

The chord and midpoint views retain every sample, up to 100,000 per method. The probability bar spans 0–100%: fill shows the sample proportion, the vertical mark the exact probability, and the whisker a 95% Wilson interval for sampling uncertainty. No sample estimate or interval is shown before the first draw.

Histograms use 16 equal distance bins, with exact bin probabilities integrated to handle the endpoint density’s divergence at the rim. Their shared vertical scale measures the fraction of samples per bin.

Reference

Charles M. Grinstead and J. Laurie Snell, Introduction to Probability, §2.1, Example 2.6, pp. 47–50.