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 Solvers134
Suggested Problems
-
Find the longest sequence of 1's in a binary sequence.
6700 Solvers
-
Project Euler: Problem 2, Sum of even Fibonacci
2840 Solvers
-
Back to basics - mean of corner elements of a matrix
463 Solvers
-
11495 Solvers
-
1030 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!
