hw3sln - IEOR 161 Operations Research II University of...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
IEOR 161 Operations Research II University of California, Berkeley Spring 2008 Homework 3 Suggested Solution Chapter 3. 49. (a) Let A be the event that A wins. Let Y be the number of wins in the first two games. P ( A ) = P ( A | Y = 0) P ( Y = 0) + P ( A | Y = 1) P ( Y = 1) + P ( A | Y = 2) P ( Y = 2) = P ( A )2 p (1 - p ) + p 2 P ( A ) = p 2 1 - 2 p (1 - p ) (b) Let N be the number of games played. E ( N ) = E ( N | Y = 0) P ( Y = 0) + E ( N | Y = 1) P ( Y = 1) + E ( N | Y = 2) P ( Y = 2) = 2(1 - p ) 2 (2 + E ( N ))2 p (1 - p ) + 2 p 2 E ( N ) = 2 1 - 2 p (1 - p ) 54. Let X be the coin picked. P { X = n } = n 10 . P { N = k } = 10 X n =1 P { N = k | X = n } P { X = n } = 10 X n =1 (1 - n 10 ) k - 1 n 10 1 10 N is not a geometric. If the coin was reselected after each flip, N will be geometric. 63. (a) Let I i = ± 1 there is only one type i in the final selection; 0 more than one type i in the final selection. P
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 03/03/2009 for the course IEOR 161 taught by Professor Lim during the Fall '08 term at Berkeley.

Page1 / 2

hw3sln - IEOR 161 Operations Research II University of...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online