Buffon's noodle explained

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.

Buffon's needle

See main article: Buffon's needle. Suppose there exist infinitely many equally spaced parallel, horizontal 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

\ell be the length of the needle and D be the distance between two adjacent lines. Then, let \theta be the acute angle the needle makes with the horizontal, and let 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

x \le (\ell \sin \theta)/(2) . We see this condition from the right triangle formed by the needle, the nearest line, and the line of length x when the needle lies across the nearest line.

Now, we assume that the values of

x, \theta are randomly determined when they land, where 0 < x < (D)/(2) , since 0 < \ell < D , and 0 < \theta < (\pi)/(2) . The sample space for x, \theta is thus a rectangle of side lengths (D)/(2) and (\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

x \le (\ell)/(2) \sin \theta . Since 0 < \ell < D , the area of this intersection is given byArea(event) = \int ^{\pi/ 2} _{0} (\ell 2)/(\sin) \theta d \theta =- (\ell 2)/(\cos) (\pi 2)/(+) (\ell)/(2) \cos 0 = (\ell)/(2 .)

Now, the area of the sample space is

Area(samplespace) = (D)/(2) x (\pi)/(2) = (D \pi)/(4) .

Hence, the probability

P of the event isP = (Area(event))/(Area(samplespace)) = (\ell)/(2) ⋅ (4)/(D \pi) = (2 \ell)/(\pi D) .

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:

E(X _{1+ … +X} _{n)} = E(X _{1)+ … +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).

Barbier's theorem

Extending this argument slightly, if

C is a convex compact subset of \R ^{2} , then the expected number of lines intersecting C is equal to half the expected number of lines intersecting the perimeter of C , which is (|\partial C|)/(\pi D) .

In particular, if the noodle is any closed curve of constant width D, then the number of crossings is also exactly 2. This means the perimeter has length

\pi D , the same as that of a circle, proving Barbier's theorem.

References

• 10.2307/2317945. 0002-9890. 76. Buffon's Noodle Problem. 8, October 1969. 916–918. Ramaley. J. F.. The American Mathematical Monthly. 1969. Mathematical Association of America. 2317945. 2020-02-05. 2020-01-14. https://web.archive.org/web/20200114072815/http://web1.sph.emory.edu/users/hwu30/teaching/statcomp/papers/ramaley.Buffon.69.pdf. dead.
• Book: 1997 . Introduction to geometric probability . Daniel A. Klain . Gian-Carlo Rota . . 978-0-521-59654-1 . registration . 1 . Gian-Carlo Rota . .

External links

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