Question
Suppose that a fair coin is flipped $n$ times. For $k>0$, find an upper bound on the probability that there is a sequence of $\log _{2} n+k$ consecutive heads.
Step 1
Since the coin is fair, the probability of getting a head in a single flip is $\frac{1}{2}$. Show more…
Show all steps
Your feedback will help us improve your experience
Amany Waheeb and 61 other educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
A fair coin is independently flipped $n$ times, $k$ times by $A$ and $n-k$ times by $B$. Show that the probability that $A$ and $B$ flip the same number of heads is equal to the probability that there are a total of $k$ heads.
A coin having probability $p$ of landing heads is flipped $n$ ti es. Compute the expected number of runs of heads of size 1 , of size 2, of $:$ e $k, 1 \leq k \leq n$.
Properties Of Expectation
Theoretical Exercises
The expected (average) number of tosses of a fair coin required to obtain the first head is $\sum_{k=1}^{\infty} k\left(\frac{1}{2}\right)^{k} .$ Evaluate this series and determine the expected number of tosses. (Hint: Differentiate a geometric series.)
Power Series
Working with Taylor Series
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD