Misplaced Pages

This is an old revision of this page, as edited by Gaius Cornelius (talk | contribs) at 20:34, 3 June 2011 (Tidy using AWB). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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 century. That problem solved by Buffon was the earliest geometric probability problem to be solved.

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 ${\displaystyle P=2L/\pi D}$, where D is the distance between two adjacent lines, and L is the length of the needle. See this simulation.

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 (observe that a curved noodle may cross a single line multiple times).

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:

${\displaystyle 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 per toss 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).

There is one more surprising consequence. In case the noodle is any closed curve of constant width D the number of crossing is also exactly 2. This implies Barbier's theorem asserting that the perimeter is the same as that of a circle.

References

• Ramaley, J. F. (1969). "Buffon's Noodle Problem". The American Mathematical Monthly. 76 (8, October 1969). Mathematical Association of America: 916–918. doi:10.2307/2317945. ISSN 0002-9890. JSTOR 2317945.
• Daniel A. Klain; Gian-Carlo Rota (1997). Introduction to geometric probability. Cambridge University Press. ISBN 9780521596541.

External links

• Interactive math page

• Integral geometry