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?
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?
Share this post
Link to post
Share on other sites