Buffon's noodle

From testwiki
Jump to navigation Jump to search

Template:Short description 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]

This variation of the Buffon's needle problem can be stated as follows:

Template:Quote

Remarkably, this expected number turns out to be independent of the noodle's shape, an observation that also allows an elegant proof of the formula for this expected number as a function of D and ℓ.

Buffon's needle

Template:Main 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 ℓ be the length of the needle and D be the distance between two adjacent lines. Then, let θ 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≤ℓsin⁡θ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,θ are randomly determined when they land, where 0<x<D2, since 0<ℓ<D, and 0<θ<π2. The sample space for x,θ is thus a rectangle of side lengths D2 and π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≤ℓ2sin⁡θ. Since 0<ℓ<D, the area of this intersection is given by

Area (event)=∫0π/2ℓ2sin⁡θdθ=−ℓ2cos⁡π2+ℓ2cos⁡0=ℓ2.

Now, the area of the sample space is

Area (sample space)=D2×π2=Dπ4.

Hence, the probability P of the event is

P=Area (event)Area (sample space)=ℓ2⋅4Dπ=2ℓπD.[2]

Since the needle cannot cross more than one line at a time (or at best can do so only with probability zero, if its length exactly equals the distance between the lines), P is also the expected number of crossings the needle makes with a line. This is mostly irrelevant to the original Buffon's needle problem, but turns out to be essential to the generalization.

Bending the needle

The formula 2ℓπD, interpreted as the expected number of line crossings, remains valid even if the needle is bent in any way (subject to the constraint that it must lie in a plane), making it a "noodle"—an arbitrary plane curve. With this reinterpretation, we can also drop the assumption that the length of the noodle is no more than the distance between the parallel lines.

The shape of the noodle affects the probability distribution of the number of crossings, but not the expected number of crossings, which only depends only on the length ℓ 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 Xi be the number of times the i-th 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(X1+⋯+Xn)=E(X1)+⋯+E(Xn).

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 ℓ.

Then the problem is to find the constant. For this, we may consider the case where the noodle is a perfect circle with diameter equal to the distance D between the parallel lines, thus having a circumference of ℓ=πD. In this case the number of crossings is always exactly 2: either the circle crosses a single line twice and touches no other lines, or (with probability zero) it just barely touches two adjacent lines at a single point each.

Since the expected number of crossings is independent of the shape of the noodle, it must thus be 2 for all noodles with length ℓ=πD, and thus the constant of proportionality must be 2πD.

Barbier's theorem

Extending this argument slightly, if C is a convex compact subset of ℝ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 |∂C|π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 πD, the same as that of a circle, proving Barbier's theorem.

See also

Notes

Template:Reflist

References

Template:Probability problems