![]() |
|
|||||||||||||||||
Bertrand's paradox (probability)
Bertrand's paradox is a problem in probability theory. Consider an equilateral triangle inscribed in a circle. Suppose a chord of the circle is chosen at random. What is the probability that the chord is longer than a side of the triangle? This problem was originally posed by Joseph Bertrand in his work, Calcul des probabilités (1888). Bertrand gave three arguments, all apparently valid, yet yielding inconsistent results.
Bertrand intended to show that the classical definition of probability is not applicable to a problem with an infinity of possible outcomes. According to the classical definition, the probability of a compound event is the ratio of the number of favorable cases to the total number of cases. Such a definition is inapplicable here, for there are an infinity of chords. Extrapolating the classical definition to ratios of lengths (solutions 1 and 2) or areas (solution 3) seems to yield inconsistent results. The difficulty hinges on the means by which a chord is chosen "at random". It turns out that once the method of random selection is specified, the problem has a well-defined solution. There is no unique selection method, so there cannot be a unique solution. The three solutions presented by Bertrand correspond to different selection methods, and in the absence of further information there is no reason to prefer one over another. The selection methods can be visualized as follows. Other than a diameter, a chord is uniquely identified by its midpoint. Each of the three selection methods presented above yields a different distribution of midpoints. Solutions 1 and 2 yield two different nonuniform distributions, while solution 3 yields a uniform distribution. Other distributions can easily be imagined, each of which will yield a different proportion of chords which are longer than a side of the inscribed triangle. References
External linksThe contents of this article are licensed from Wikipedia.org under the GNU Free Documentation License.
How to see transparent copy 01-04-2007 01:21:04 |
|





