Credit for this puzzle goes to the author of the blog, By Way of Contradiction.
Imagine that you have a collection of very weird dice. For every prime number between 1 and 1000, you have a fair die with that many sides. Your goal is to generate a uniform random integer from 1 to 1001, inclusive.
What is the fewest expected number of die rolls needed to complete this task?
Question
gavinksong
Credit for this puzzle goes to the author of the blog, By Way of Contradiction.
Imagine that you have a collection of very weird dice. For every prime number between 1 and 1000, you have a fair die with that many sides. Your goal is to generate a uniform random integer from 1 to 1001, inclusive.
What is the fewest expected number of die rolls needed to complete this task?
Link to comment
Share on other sites
25 answers to this question
Recommended Posts
Join the conversation
You can post now and register later. If you have an account, sign in now to post with your account.