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 Solvers132
Suggested Problems
-
3403 Solvers
-
Remove the small words from a list of words.
1559 Solvers
-
1872 Solvers
-
(Linear) Recurrence Equations - Generalised Fibonacci-like sequences
411 Solvers
-
Create block matrix of integers (j+k-1) - Part I
118 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!
