[This article was first published on R – Xi'an's Og, 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.
Want to share your content on R-bloggers? click here if you have a blog, or here if you don't.
A challenge found on the board of the coffee room at CEREMADE, Université Paris Dauphine:
When sampling with replacement three numbers in {0,1,…,N}, what is the probability that their average is (at least) one of the three?
With a (code-golfed!) brute force solution of
mean(!apply((a<-sample(0:n,3e6,rep=T),3)),2,mean)-apply(a,2,median))
producing a graph pretty close to 3N/2(N+1)² (which coincides with a back-of-the-envelope computation):
To leave a comment for the author, please follow the link and comment on their blog: R – Xi'an's Og.
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.