ผลต่างระหว่างรุ่นของ "Probstat/coupon practice"

จาก Theory Wiki
ไปยังการนำทาง ไปยังการค้นหา
แถว 4: แถว 4:
  
 
== Analysis on the probability ==
 
== Analysis on the probability ==
 +
Use the approach that we analyze the fullest bin to find the upper bound on the probability that we throw ''k'' balls into ''n'' bin and there exists some bin which is empty.
 +
 +
'''Hint:''' Try define an appropriate event ''B<sub>i</sub>'' for bin ''i''.
  
 
== Computing the expectation ==
 
== Computing the expectation ==

รุ่นแก้ไขเมื่อ 06:46, 25 กันยายน 2557

This is part of probstat and Probstat/week6 practice 2.
Please watch the 1st clip (part 1), and think about how to use the balls-and-bins experiment to analyze the coupon collector's problem before watching the 2nd clip (part 2). If you have tried to use the approach we used to analyze the fullest bin to find the upperbound for the number balls, please proceed on this page.

Analysis on the probability

Use the approach that we analyze the fullest bin to find the upper bound on the probability that we throw k balls into n bin and there exists some bin which is empty.

Hint: Try define an appropriate event Bi for bin i.

Computing the expectation