Courant Institute New York University FAS CAS GSAS

# Illustrating Bertrand's Paradox with GeoGebra

Friday, July 24, 2009 - 9:27am

Sorry, the GeoGebra Applet could not be started. Please make sure that Java 1.4.2 (or later) is installed and active in your browser (Click here to install Java now)

Bertrand's Paradox is a question in continuous probability that shows the perils of uniformly distributed variables. The question is simple: given a random chord in a circle, what's the probability that it's longer than the side length of an equilateral triangle inscribed in that circle? (OK, maybe that's not so simple to state. But the side length can be shown to be sqrt(3) times the radius.)

To demonstrate this in class I whipped up a GeoGebra worksheet. I have three circles, and three different ways to define a chord of that circle. I used the Dynamic Color feature to color the chord red if it's too short and green if it's long enough.

In the first circle a vertex of triangle and the first endpoint of the chord are put at the same place. When you arrange things this way, it's clear the chord is long enough only when the other endpoint is between the other two vertices of the triangle. If you drag around the other endpoint of the chord, you see it turns green exactly then. So in this method the probability of the chord being long enough is 1/3

In the second circle a random radius is selected, and a random point on that radius is selected. By drawing a perpendicular to the radius at the point a chord can be determined. You can drag S and T around to draw various chords. If you align the radius to be an altitude of the triangle (perpendicular to one its sides), you see the triangle and radius intersect in the midpoint of the radius. This means the chord is long enough precisely when the point on the radius is closer to the center than the midpoint. And this is independent of the radius angle. So in this method the probability of the chord being long enough is 1/2.

In the third circle a random point within the circle is selected, and by drawing the radius through that point and a similar perpendicular as in the second method, a chord can be constructed. Here we can see that the chord is long enough only when the point is within half the radius of the center. So the probability this time is the radius of the area of the small circle to that of the big circle, or 1/4.

So which is it? Like many paradoxes, refining the question produces the answer. The second (polar coordinates) method is the one which is invariant under translations and scalings of the plane, so it has an advantage over the other two. But the point of the exercise is to show that uniform distributions aren't as uniform as you'd think!