Problem 56000. Estimating Euler's (Oi-ler-z) Number
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 commentsProblem Recent Solvers78
Suggested Problems
-
Find nearest prime number less than input number
712 Solvers
-
5344 Solvers
-
807 Solvers
-
958 Solvers
-
206 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!