Euler's number is an irrational constant given by 
Starting with x=0, count the number of times you can add a uniformly distributed random number to x before it equals or exceeds 1. Repeat this N times, then calculate the estimate of Euler's number by computing the mean of those counts.
The more iterations calcualted, the closer the approximation should be.
The input to your function should be the number of iterations of the algorithm to perform (N) and the output should be the estimate of Euler's number.
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers139
Suggested Problems
-
Extract leading non-zero digit
2257 Solvers
-
Sum all integers from 1 to 2^n
18096 Solvers
-
Project Euler: Problem 7, Nth prime
1780 Solvers
-
Create an n-by-n null matrix and fill with ones certain positions
738 Solvers
-
2612 Solvers
More from this Author12
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
