We have two coins: coin A gives heads with probability 1/3; coin B gives heads with probability 9/10.
Pick one of the two, call it C, is selected randomly (using equal probability).
Devise a scheme that involves flipping C at most n times, looking at the results, and declaring whether C = A or C = B. We want the declaration to be correct at least 999,999 times out of a million. And we want n to be as small as possible.
Question
BMAD
We have two coins: coin A gives heads with probability 1/3; coin B gives heads with probability 9/10.
Pick one of the two, call it C, is selected randomly (using equal probability).
Devise a scheme that involves flipping C at most n times, looking at the results, and declaring whether C = A or C = B. We want the declaration to be correct at least 999,999 times out of a million. And we want n to be as small as possible.
Link to comment
Share on other sites
1 answer 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.