## Probability and Computing: Chapter 1 Exercises (Cont. 5)

Exercise 1.9: 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.