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 Solvers138
Suggested Problems
-
Number of 1s in the Binary Representation of a Number
485 Solvers
-
Is this triangle right-angled?
6624 Solvers
-
Convert given decimal number to binary number.
2359 Solvers
-
4712 Solvers
-
String Array Basics, Part 1: Convert Cell Array to String Array; No Missing Values
2066 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!
