Buffon's Needle
From Math Images
| Line 3: | Line 3: | ||
|Image=BuffonNeedle 700.gif | |Image=BuffonNeedle 700.gif | ||
|ImageIntro=The Buffon's Needle problem is a mathematical method of approximating the value of pi <math>(\pi = 3.1415...) </math>involving repeatedly dropping needles on a sheet of lined paper and observing how often the needle crosses a line. | |ImageIntro=The Buffon's Needle problem is a mathematical method of approximating the value of pi <math>(\pi = 3.1415...) </math>involving repeatedly dropping needles on a sheet of lined paper and observing how often the needle crosses a line. | ||
| - | |ImageDescElem=The method was first used to approximate | + | |ImageDescElem=The method was first used to approximate π by Georges-Louis Leclerc, the Comte de Buffon, in 1777. Buffon apparently first tried throwing bread sticks over his shoulder and counting how often they crossed a line on his tile floor. He was intrigued by the relationship he observed between the probability of a cross and π. |
| - | Subsequent mathematicians have used the method with needles instead of bread sticks, or with computer simulations. In the case where the distance between the lines is equal the length of the needle, an approximation of | + | Subsequent mathematicians have used the method with needles instead of bread sticks, or with computer simulations. In the case where the distance between the lines is equal the length of the needle, an approximation of π can be calculated using the equation |
<math> | <math> | ||
| Line 17: | Line 17: | ||
[[Image:willtheneedlecross ps10.jpg|right]] | [[Image:willtheneedlecross ps10.jpg|right]] | ||
| - | To prove that the Buffon's Needle experiment will give an approximation of | + | To prove that the Buffon's Needle experiment will give an approximation of π, we can consider which positions of the needle will cause an intersection. The variable θ is the acute angle between 0 and <math> \tfrac {\pi}{2} </math> made by the needle and an imaginary line parallel to the ones on the paper. Finally, ''d'' is the distance between the center of the needle and the nearest line. |
| Line 32: | Line 32: | ||
====The Probability of an Intersection==== | ====The Probability of an Intersection==== | ||
| - | To approximate | + | To approximate π using Buffon's method, we need to know the probability of a cross. If we graph the outcomes of θ along the X axis and ''d'' along the Y, we have the <balloon title="In probability theory, the sample space of an experiment is the set of all possible outcomes."> sample space</balloon> for the trials. In the diagram below, the sample space is contained by the dashed lines. |
| Line 54: | Line 54: | ||
====Using Random Samples to Approximate Pi==== | ====Using Random Samples to Approximate Pi==== | ||
| - | The original goal of the Buffon's needle method, approximating | + | The original goal of the Buffon's needle method, approximating π, can be achieved by using probability to solve for π. If a large number of trials is conducted, the proportion of times a needle intersects a line will be close to the probability of an intersection. That is, the number of line hits divided by the number of drops will equal approximately the probability of hitting the line. |
<math> \frac {\mbox{number of drops}}{\mbox{number of hits}} \approx P_{hit} = \frac {2}{\pi}</math> | <math> \frac {\mbox{number of drops}}{\mbox{number of hits}} \approx P_{hit} = \frac {2}{\pi}</math> | ||
| Line 62: | Line 62: | ||
<math> \frac {\mbox{number of drops}}{\mbox{number of hits}} \approx \frac {2}{\pi}</math> | <math> \frac {\mbox{number of drops}}{\mbox{number of hits}} \approx \frac {2}{\pi}</math> | ||
| - | Therefore, we can solve for | + | Therefore, we can solve for π: |
<math> \pi \approx \frac {2 * {\mbox{number of drops}}}{\mbox{number of hits}} </math> | <math> \pi \approx \frac {2 * {\mbox{number of drops}}}{\mbox{number of hits}} </math> | ||
| Line 79: | Line 79: | ||
The Buffon's needle problem was the first recorded use of a Monte Carlo method. These methods employ repeated random sampling to approximate a probability, instead of computing the probability directly. Monte Carlo calculations are especially useful when the nature of the problem makes a direct calculation impossible or unfeasible, and they have become more common as the introduction of computers makes randomization less laborious. | The Buffon's needle problem was the first recorded use of a Monte Carlo method. These methods employ repeated random sampling to approximate a probability, instead of computing the probability directly. Monte Carlo calculations are especially useful when the nature of the problem makes a direct calculation impossible or unfeasible, and they have become more common as the introduction of computers makes randomization less laborious. | ||
| - | + | π is a mathematical constant whose value is the ratio of any circle's circumference to its diameter in Euclidean space. π is an irrational number, which means that its value cannot be expressed exactly as a fraction a/b, where a and b are integers. Since π is irrational, mathematicians have been challenged with trying to determine increasingly accurate approximations. In the past 50 years especially, improvements in computer capability allow mathematicians to determine more decimal places. Nonetheless, better methods of approximation are still desired. | |
[[Image:history of pi1.jpg|800px]] | [[Image:history of pi1.jpg|800px]] | ||
| - | A recent study conducted the Buffon's Needle experiment to approximate | + | A recent study conducted the Buffon's Needle experiment to approximate π using computer software. The researchers administered 30 trials for each number of drops, and averaged their estimates for π. They noted the improvement in accuracy as more trials were conducted. |
[[Image:box1.jpg]] | [[Image:box1.jpg]] | ||
| - | These results show that Buffon's Needle approximation is a relatively tedious process because the estimates converge towards | + | These results show that Buffon's Needle approximation is a relatively tedious process because the estimates converge towards π rather slowly compared to other computer generated techniques. Nonetheless, the intriguing relationship between the probability of a needle's intersection and the value of π has attracted mathematicians to study the Buffon's Needle method since its introduction in the 18th century. Buffon's approach has since been used in studies ranging from the behavior of ants to the Manhattan Project of developing atomic bombs in WWII. The problem remains relevant as variations can make the its accessible to a wide range of mathematical abilities. The method can be found everywhere from a simple demonstration in a middle school classroom to an exam for graduate students. |
Revision as of 12:07, 8 June 2010
| Buffon's Needle |
|---|
Contents |
Basic Description
The method was first used to approximate π by Georges-Louis Leclerc, the Comte de Buffon, in 1777. Buffon apparently first tried throwing bread sticks over his shoulder and counting how often they crossed a line on his tile floor. He was intrigued by the relationship he observed between the probability of a cross and π.
Subsequent mathematicians have used the method with needles instead of bread sticks, or with computer simulations. In the case where the distance between the lines is equal the length of the needle, an approximation of π can be calculated using the equation

A More Mathematical Explanation
Will the Needle Cross a Line?
To prove that the Buffon's Needle experiment will give an approximation of π, we can consider which positions of the needle will cause an intersection. The variable θ is the acute angle between 0 and
made by the needle and an imaginary line parallel to the ones on the paper. Finally, d is the distance between the center of the needle and the nearest line.
Since the needle drops are random, there is no reason why the needle should be more likely to intersect one line than another. As a result, we can simplify our proof by focusing on a particular strip of the paper bounded by two lines.
We can extend line segments from the center and tip of the needle to meet at a right angle. A needle will cut a line if the green arrow, d, is shorter than the leg opposite θ. More precisely, it will cross when
See case 1, where the needle falls at a relatively small angle with respect to the lines. Visually we can see that a needle lying at such a small angle will only intersect if the center falls close to one of the parallel lines. In case 2, the needle crosses even though the center of the needle is far from both lines because the angle is so large.
The Probability of an Intersection
To approximate π using Buffon's method, we need to know the probability of a cross. If we graph the outcomes of θ along the X axis and d along the Y, we have the sample space for the trials. In the diagram below, the sample space is contained by the dashed lines.
The sample space is useful in this type of simulation because it gives a visual representation of all the possible ways the needle can fall. Each point on the graph represents some combination of an angle and distance that a needle might occupy. We divide the area that contains combinations that will cause an intersection by the total possible positions to calculate the probability.
There will be an intersection if
, which is represented by the blue region. The area under this curve represents all the combinations of distances and angles that will cause the needle to cross a line. The area under the blue curve, which is equal to
in this case, can found by evaluating the integral
Then, the area of the sample space can be found by multiplying the length of the rectangle by the height.
The probability of a hit can be calculated by taking the number of total ways a cross can occur over the total number possible outcomes (the number of trials). For needle drops, the probability is proportional to the ratio of the two areas in this case because each possible value of θ and d is equally probable. The probability of a cross is
Using Random Samples to Approximate Pi
The original goal of the Buffon's needle method, approximating π, can be achieved by using probability to solve for π. If a large number of trials is conducted, the proportion of times a needle intersects a line will be close to the probability of an intersection. That is, the number of line hits divided by the number of drops will equal approximately the probability of hitting the line.
So
Therefore, we can solve for π:
Watch a Simulation
Why It's Interesting
Teaching Materials
- There are currently no teaching materials for this page. Add teaching materials.
References
[1] http://www.maa.org/mathland/mathtrek_5_15_00.html
[2] http://mste.illinois.edu/reese/buffon/bufjava.html
[3] http://www.absoluteastronomy.com/topics/Monte_Carlo_method
[4] The Number Pi. Eymard, Lafon, and Wilson.
[5] Monte Carlo Methods Volume I: Basics. Kalos and Whitlock.
[6] Heart of Mathematics. Burger and Starbird
[7] http://math.tntech.edu/techreports/TR_2001_4.pdf
Leave a message on the discussion page by clicking the 'discussion' tab at the top of this image page.

involving repeatedly dropping needles on a sheet of lined paper and observing how often the needle crosses a line.




. This equation makes sense when we consider the normal case, where l =1 and d =1, so these variables disappear and the probability is
.




