Buffon's noodle

From Wikipedia, the free encyclopedia

In geometric probability, the problem of Buffon's noodle is a variation on the well-known problem of Buffon's needle, named after Georges-Louis Leclerc, Comte de Buffon who lived in the 18^th century. That problem solved by Buffon was the earliest geometric probability problem to be solved.

1 Buffon's needle
2 Bending the needle
3 References
4 External links

[edit] Buffon's needle

Suppose there exist an infinite number of equally spaced parallel lines, and we were to randomly toss a needle whose length is less than or equal to the distance between adjacent lines. What is the probability that the needle will cross a line? The formula is P = 2L/πD, where D is the distance between two adjacent lines, and L is the length of the needle. See this simulation.

[edit] Bending the needle

The interesting thing about the formula is that it stays the same even when you bend the needle in any way you want (subject to the constraint that it must lie in a plane), making it a noodle—a rigid plane curve. We drop the assumption that the length of the noodle is no more than the distance between the parallel lines.

The probability distribution of the number of crossings depends on the shape of the noodle, but the expected number of crossings does not; it depends only on the length L of the noodle and the distance D between the parallel lines.

This fact may be proved as follows (see Klain and Rota). First suppose the noodle is piecewise linear, i.e. consists of n straight pieces. Let X_i be the number of times the ith piece crosses one of the parallel lines. These random variables are not independent, but the expectations are still additive:

$E(X_1+\cdots+X_n) = E(X_1)+\cdots+E(X_n).$

Regarding a curved noodle as the limit of a sequence of piecewise linear noodles, we conclude that the expected number of crossings is proportional to the length; it is some constant times the length L. Then the problem is to find the constant. In case the noodle is a circle of diameter equal to the distance D between the parallel lines, then L = πD and the number of crossings is exactly 2, with probability 1. So when L = πD then the expected number of crossings is 2. Therefore the expected number of crossings must be 2L/(πD).

[edit] References

J.F. Ramaley, "Buffon's Noodle Problem", American Mathematical Monthly, volume 76, number 8, 1969, pages 916–918.
D.A. Klain and G.-C. Rota, Introduction to Geometric Probability, Cambridge University Press, 1997