Skip to content

Latest commit

 

History

History
66 lines (43 loc) · 3.46 KB

File metadata and controls

66 lines (43 loc) · 3.46 KB

Exercises 5.4-1


How many people must there be in a room before the probability that someone has the same birthday as you do is at least 1/2? How many people must there be before the probability that at least two people have a birthday on July 4 is greater than 1/2?

Answer

Exercises 5.4-2


Suppose that balls are tossed into b bins. Each toss is independent, and each ball is equally likely to end up in any bin. What is the expected number of ball tosses before at least one of the bins contains two balls?

Answer

This is a rewording of the Birthday Problem. The answer is the following:

check Quora and wiki

Exercises 5.4-3


For the analysis of the birthday paradox, is it important that the birthdays be mutually independent, or is pairwise independence sufficient? Justify your answer.

Answer

Pairwise independence is sufficient.

Exercises 5.4-4


How many people should be invited to a party in order to make it likely that there are three people with the same birthday?

Answer

If n=365 and k is the number of people at the party:

Exercises 5.4-5


What is the probability that a k-string over a set of size n is actually a k-permutation? How does this question relate to the birthday paradox?

Answer

To be a k-permutation, there can be no repeated letters, so this is the birthday problem where k is the number of people and n is the number of days.

Exercises 5.4-6


Suppose that n balls are tossed into n bins, where each toss is independent and the ball is equally likely to end up in any bin. What is the expected number of empty bins? What is the expected number of bins with exactly one ball?

Answer

Exercises 5.4-7


Sharpen the lower bound on streak length by showing that in n flips of a fair coin, the probability is less than 1/n that no streak longer than lg n-2 lg lg n consecutive heads occurs.

Answer

UNSOLVED


Follow @louis1992 on github to help finish this task.