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 18th century. This approach to the problem was published by Joseph-Émile Barbier in 1860.^[1]

Buffon's needle

Suppose there exist infinitely many 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 lie across a line upon landing?

To solve this problem, let ${\displaystyle \ell }$ be the length of the needle and ${\displaystyle D}$ be the distance between two adjacent lines. Then, let ${\displaystyle \theta }$ be the acute angle the needle makes with the horizontal, and let ${\displaystyle x}$ be the distance from the center of the needle to the nearest line.

The needle lies across the nearest line if and only if ${\displaystyle x\leq {\frac {\ell \cos \theta }{2}}}$. We see this condition from the right triangle formed by the needle, the nearest line, and the line of length ${\displaystyle x}$ when the needle lies across the nearest line.

Now, we assume that the values of ${\displaystyle x,\theta }$ are randomly determined when they land, where ${\displaystyle 0<x<{\frac {D}{2}}}$, since ${\displaystyle 0<\ell <D}$, and ${\displaystyle 0<\theta <{\frac {\pi }{2}}}$. The sample space for ${\displaystyle x,\theta }$ is thus a rectangle of side lengths ${\displaystyle {\frac {D}{2}}}$ and ${\displaystyle {\frac {\pi }{2}}}$.

The probability of the event that the needle lies across the nearest line is the fraction of the sample space that intersects with ${\displaystyle x\leq {\frac {\ell }{2}}\cos \theta }$. Since ${\displaystyle 0<\ell <D}$, the area of this intersection is given by

${\displaystyle {\text{Area (event)}}=\int _{0}^{\pi /2}{\frac {\ell }{2}}\cos \theta \,d\theta ={\frac {\ell }{2}}\sin {\frac {\pi }{2}}-{\frac {\ell }{2}}\sin 0={\frac {\ell }{2}}.}$

Now, the area of the sample space is

${\displaystyle {\text{Area (sample space)}}={\frac {D}{2}}\times {\frac {\pi }{2}}={\frac {D\pi }{4}}.}$

Hence, the probability ${\displaystyle P}$ of the event is

${\displaystyle P={\frac {\text{Area (event)}}{\text{Area (sample space)}}}={\frac {\ell }{2}}\cdot {\frac {4}{D\pi }}={\frac {2\ell }{\pi D}}.}$^[2]

Bending the needle

The formula stays the same even when the needle is bent in any way (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 due to the linearity of expectation:

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

Notes

References

• Ramaley, J. F. (1969). "Buffon's Noodle Problem" (PDF). The American Mathematical Monthly. Mathematical Association of America. 76 (8, October 1969): 916–918. doi:10.2307/2317945. ISSN 0002-9890. JSTOR 2317945. Archived from the original (PDF) on 2020-01-14. Retrieved 2020-02-05.
• Daniel A. Klain; Gian-Carlo Rota (1997). Introduction to geometric probability. Cambridge University Press. p. 1. ISBN 978-0-521-59654-1.

External links

• Interactive math page at Cut-the-Knot website
• Interactive Wolfram CDF demonstration