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
-
Given an unsigned integer x, find the largest y by rearranging the bits in x
2063 Solvers
-
Given a matrix, swap the 2nd & 3rd columns
1283 Solvers
-
Relative ratio of "1" in binary number
1668 Solvers
-
5963 Solvers
-
3683 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!
