7899
TOPICS
LATEST
ABOUT
AUTHORING AREA
PARTICIPATE
Your browser does not support JavaScript or it may be disabled!
Getting e from Randomness
In a running average, the sum of
trials is divided by
. If you select
real numbers between 0 and 1 until the total exceeds 1, the running average of
approaches
, shown here as a solid purple line.
Contributed by:
Ed Pegg Jr
THINGS TO TRY
Slider Zoom
SNAPSHOTS
RELATED LINKS
e
(
Wolfram
MathWorld
)
PERMANENT CITATION
"
Getting e from Randomness
" from
the Wolfram Demonstrations Project
http://demonstrations.wolfram.com/GettingEFromRandomness/
Contributed by:
Ed Pegg Jr
Share:
Embed Interactive Demonstration
New!
Download Demonstration as CDF »
Download Source Code »
(preview »)
Files require
Wolfram
CDF Player
or
Mathematica
.
Related Demonstrations
More by Author
Random Chord Paradox
Ed Pegg Jr
Randomness in the Digits of Square Roots
Stephen Wolfram
Randomness in the Digits of Pi
Stephen Wolfram
Random Ink Blot
Andy Ross
Random Number Generation
Hector Zenil
Random Branching Process
Stephen Wolfram
Generic Random Walk and Maximal Entropy Random Walk
Bartlomiej Waclaw
Random Subdivision of a Square
Enrique Zeleny
Fleeting Random Question Marks
Jacqueline Zizi
Simulating the Simple Random Walk
Heikki Ruskeepää
Related Topics
Random Processes
Browse all topics
Contribute
Make a new version of this Demonstration
Upload a new Demonstration
Note: To run this Demonstration you need Mathematica 7+ or the free Mathematica Player 7EX
Download or upgrade to
Mathematica Player 7EX
I already have
Mathematica Player
or
Mathematica 7+