- Problem 3 Point Graded 0 1 People Are Arriving At A Party One At A Time While Waiting For More People To Arrive They 1 (177.35 KiB) Viewed 178 times
- Problem 3 Point Graded 0 1 People Are Arriving At A Party One At A Time While Waiting For More People To Arrive They 2 (154.97 KiB) Viewed 178 times
- Problem 3 Point Graded 0 1 People Are Arriving At A Party One At A Time While Waiting For More People To Arrive They 3 (148.09 KiB) Viewed 178 times
Problem 3 point (graded) 0/1 People are arriving at a party one at a time. While waiting for more people to arrive they entertain themselves by comparing their birthdays. Let X be the number of people needed to obtain a birthday match, i.e., before person X arrives there are no two people with the same birthday, but when person X arrives there is a match. For example, X = 10 would mean that the first nine people to arrive all have different birthdays, but the tenth person to arrive matches one of the first nine. Find .P (X = 3 or X = 4)
FOR PROBLEM 4 .Let X be the number of Heads in 10 fair coin tosses Problem 4a point possible (graded) 1 . Find the conditional PMF of X, given that the first two tosses both land Heads (a) 10 1024 (1–2), for k = 2, 3, ..., 10 O 8 256 (x-2), for k= 2,3,...,10 O 123), for k = 2, 3,..., 10 O ( O k 1013 (19), for k = 2, 3, ..., 10 O
Problem 4b point possible (graded) 1 Find the conditional PMF of X, given that at least two tosses land Heads (b) 1024 (19), for k = 2, 3, ..., 100 10 k2 8 23 (2), for k = 2, 3, ..., 10 1 256 O (4), for k = 2, 3,...,10 128 O 1013 0 (10), for k = 2, 3, ..., 10 لقد استخدمت 0 من إجمالي 2 محاولات اعادة الضبط حفظ تلميح