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.

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: