Simulations of Linearity of Buffon’s Needle Problem

Article Preview

Abstract:

The expected number of crossings of Buffon's needle problem is linear if the distance d between the lines of the ruled paper is less than or equal to the length l of the needle. With the help of Dynamic Geometry Super Sketchpad software, two vivid simulations of the linearity of Buffon's problem are given, that is, the expected number E(l ) satisfies E(x+y) = E(x) + E(y) and E(rx) = rE(x).

You might also be interested in these eBooks

Info:

Periodical:

Pages:

452-455

Citation:

Online since:

February 2014

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Martin Aigner and Günter M. Ziegler, eds.: Proofs from the book, Springer-Verlag, New York (2010).

Google Scholar

[2] E. Barbier: J. Mathématiques Pures et Appliquées (2) 5 (1860), 273-286.

Google Scholar

[3] D. A. Klain and G. -C. Rota, in: Introduction to Geometric Probability, Cambridge University Press, (1997).

Google Scholar

[4] T. H. OBeirne: Puzzles and Paradoxes, Oxford University Press, London, (1965).

Google Scholar

[5] Z. Jingzhong: Supper sketchpad, Science Press, Beijing, (2011) 177-179. (In Chinese).

Google Scholar

[6] Z. Jingzhong, A course of dynamic geometry, Science Press, Beijing, (2005) 143–145. (In Chinese).

Google Scholar

[7] Information on http: /www. tech4edu. cn.

Google Scholar