Problem 56000. Estimating Euler's (Oi-ler-z) Number

• Created by Ben Placek

×

Like (2)

Difficulty:

(8)

Rate

• Solve Later   
• Add To GroupÂ

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.

Solve

Solution Stats

46.4% Correct | 53.6% Incorrect

• 250 Solutions
• 108 Solvers

Last Solution submitted on Apr 05, 2025

Last 200 Solutions

Solution Comments

ANNOUNCEMENT ×

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Hello Community, We're excited to announce that registration is now open for the...

Problem Recent Solvers108

Suggested Problems

• Project Euler: Problem 10, Sum of Primes

  1897 Solvers

• Solve the set of simultaneous linear equations

  437 Solvers

• Calculate the area of a triangle between three points

  3156 Solvers

• Vector creation

  9570 Solvers

• Area Conversion 1

  815 Solvers

More from this Author12

• Where the Four Corners Am I? (Vectorized)

  121 Solvers

• Triangle Coordinates

  90 Solvers

• Split Even Number Into Two Primes

  195 Solvers

• Next Tribonacci Number

  129 Solvers

• Generate Pascal's Triangle Matrix

  125 Solvers