Suppose the function FairCoin that returns a single random bit, chosen uniformly and independently from the set 0, 1 Consider the following randomized algorithm for generating biased random bits OneInThree if FairCoin 0 return 0 else return 1 OneInThree 1 Prove that OneInThree returns 1 with probability 1 3 2 What is the exact expected number of times that this algorithm calls FairCoin

Question

Suppose the function FairCoin that returns a single random bit, chosen uniformly and independently from the set  0, 1   Consider the following randomized algorithm for generating biased random bits  OneInThree  if FairCoin   0 return 0 else return 1   OneInThree 1  Prove that OneInThree returns 1 with probability 1 3  2  What is the exact expected number of times that this algorithm calls FairCoin

SolutionInn · Accepted Answer

The Answer is in the image, click to view ...

Question: Suppose the function FairCoin that returns a single random bit, chosen uniformly and independently from the set {0, 1}. Consider the following randomized algorithm for

Step by Step Solution