# Approximating e

[This article was first published on

Want to share your content on R-bloggers? click here if you have a blog, or here if you don't.

**R – The Research Kitchen**, and kindly contributed to R-bloggers]. (You can report issue about the content on this page here)Want to share your content on R-bloggers? click here if you have a blog, or here if you don't.

I was reading Simon Singh’s The Simpsons And Their Mathematical Secrets today and he mentioned a simple method for approximating e – given a uniform RNG , e can be approximated by the average number of draws required for the sum of the draws to exceed 1. This is a neat little demonstration and easy to generate in R – taking the uniform RNG and plotting the average number of draws required to exceed a sum of one, and then replicating this using an increasing number of draws to illustrate convergence:

# Function to calculate number of draws required function() { r <- runif(1,0,1) n <- 1 while (r<1) { r <- r+runif(1,0,1) n <- n+1 } return(n) } # Generate a series of draws from 2 .. 2^16 (65536) N<-2^seq(1,16) # Generate simulation y <- sapply(N, function(x)mean(replicate(x,gen()))) # Plot convergence qplot(1:16, y) + geom_line(linetype=2) + geom_hline(aes(yintercept=exp(1)),color='red')

To

**leave a comment**for the author, please follow the link and comment on their blog:**R – The Research Kitchen**.R-bloggers.com offers

**daily e-mail updates**about R news and tutorials about learning R and many other topics. Click here if you're looking to post or find an R/data-science job.

Want to share your content on R-bloggers? click here if you have a blog, or here if you don't.