# Bertrand’s problem

Given an equilateral triangle  inscribed  on a circle, draw a chord on the circle at random. Bertrand’s problem, first posed by Joseph Bertrand in 1888, asks: what is the probability that that chord will be longer than a side of the triangle? Put another way, what is the probability that the length of a chord from a random single point along the circumference  of the circle to a vertex of the triangle will form an angle from the intersection of the angle along the circle?

1. Randomly place a dot anywhere in the circle. Then draw the chord that has that dot as its midpoint. If the distance   from the chord’s midpoint to the center of the circle is less than half the radius of the circle, then the chord will definitely be longer than a side of the triangle. The probability is then 25%. 2. Randomly place a dot anywhere on the circumference of the circle. Then draw a chord to connect that dot to any vertex of the triangle. It becomes visibly obvious that the midpoint of that chord has to fall somewhere between the two vertices other than the vertex we chose to connect our random dot to in order for the resulting chord to be longer than a side of the triangle. The probability is then approximately 33%. 3. Randomly draw a chord that is parallel   to one of the sides of the triangle. If the chord falls entirely on what is not part of the triangle, then it is clear that it will be shorter than that side. The same is true for that reflected part on the other side of the triangle. The probability is then 50%. Because three different results to this problem are obtained depending on the selection method, the problem is sometimes known as Bertrand’s paradox.

Title Bertrand’s problem BertrandsProblem 2013-03-22 16:24:18 2013-03-22 16:24:18 PrimeFan (13766) PrimeFan (13766) 14 PrimeFan (13766) Definition msc 51D20 Bertrand’s paradox CircleLinePicking