Probability Solutions for Homework #2 in ISyE 6739 (Summer 2009), Assignments of Data Analysis & Statistical Methods

Solutions to homework problems related to probability theory, covering topics such as combinations, independent events, and bayes' theorem. Students can use these solutions to check their work or gain a better understanding of the concepts.

Typology: Assignments

Pre 2010

Uploaded on 08/05/2009

koofers-user-ljp
koofers-user-ljp 🇺🇸

5

(1)

10 documents

1 / 5

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
1
ISyE 6739 Summer 2009
Homework #2 (Covers Modules 6–9) Solutions
1. A bridge hand contains 13 cards from a standard deck. Find the probability that
a bridge hand will contain
(a) Exactly 2 aces.
Solution: Ã4
248
11!
Ã52
13!2
(b) At least 2 aces.
Solution: 4
X
i=2 Ã4
i!Ã 48
13 i!/Ã52
13!2
(c) 8 spades.
Solution: Ã13
839
5!
Ã52
13!2
(d) 8 cards of the same suit.
Solution: 4Ã13
839
5!
Ã52
13!2
2. A die is thrown 7 times. Find
(a) Pr(‘6’ comes up at least once).
Solution: 1Pr(no 6’s appear) = 1 (5/6)72.
(b) Pr(each face appears at least once).
Solution: Denote the six faces by A,B,C,D,E,F. Thus, we need to find the
number of tosses of the form A,A,B,C,D,E,F. We then see that
i. The # ways to choose A is 6.
ii. The # ways to place A is Ã7
2!.
iii. The # ways to permute B,C,D,E,F is 5!.
pf3
pf4
pf5

Partial preview of the text

Download Probability Solutions for Homework #2 in ISyE 6739 (Summer 2009) and more Assignments Data Analysis & Statistical Methods in PDF only on Docsity!

ISyE 6739 – Summer 2009

Homework #2 (Covers Modules 6–9) — Solutions

  1. A bridge hand contains 13 cards from a standard deck. Find the probability that a bridge hand will contain

(a) Exactly 2 aces.

Solution:

( 4 2

)( 48 11

)

( 52 13

(b) At least 2 aces. Solution: ∑^4

i=

( 4 i

) ( 48 13 − i

) /

( 52 13

) 2

(c) 8 spades.

Solution:

( 13 8

)( 39 5

)

( 52 13

(d) 8 cards of the same suit.

Solution: 4

( 13 8

)( 39 5

)

( 52 13

  1. A die is thrown 7 times. Find

(a) Pr(‘6’ comes up at least once). Solution: 1 − Pr(no 6’s appear) = 1 − (5/6)^7 . (b) Pr(each face appears at least once). Solution: Denote the six faces by A,B,C,D,E,F. Thus, we need to find the number of tosses of the form A,A,B,C,D,E,F. We then see that i. The # ways to choose A is 6.

ii. The # ways to place A is

( 7 2

) .

iii. The # ways to permute B,C,D,E,F is 5!.

iv. The # ways to toss the die 7 times is 6^7. Thus, Pr(each face appears at least once) = 6 ·

( 7 2

) · 5!/ 67.

  1. Write a computer program in your favorite language to calculate combinations. Demonstrate your program on C 100 , 50. Solution: Don’t try to calculate big numbers like 100! directly. Make use of fractions to keep the sizes reasonable. Try something like ( 100 50

)

which should help you get around overflow problems. By the way, it turns out that ( 100 50

) = 100891344545564193334812497256. 2

  1. Twenty items (12 bad, 8 good) are inspected. If the items are chosen at random, what’s the probability that

(a) The first two are bad? Solution: 1220 · 1119 = 3395 2 (b) The first two are good? Solution: 208 · 197 = 1495 2 (c) One of each in the first two? Solution: 1 − 3395 − 1495 = 4895 2

  1. A box contains 4 bad and 6 good tubes. Two are drawn out. One is tested and found to be good. What’s the probability that the other is good? Solution: Pr(second is good|first is good) = 5/ 9 2
  2. In a class there are 4 freshman boys, 6 freshman girls, and 6 sophomore boys. How many sophomore girls must be present if gender and class are to be independent when a student is selected at random? Solution: Let x be the number of soph girls. In order for gender and class to be indep, you need to have Pr(B ∩ F ) = Pr(B)Pr(F ) Pr(G ∩ F ) = Pr(G)Pr(F ) Pr(B ∩ S) = Pr(B)Pr(S) Pr(G ∩ S) = Pr(G)Pr(S)
  1. The probability of scoring a basket is p. Joe shoots first. If he misses, Fred gets to shoot. They shoot the ball back and forth until somebody scores. What’s the probability that Joe wins? Graph this as a function of p. Solution:

Pr(Joe wins) = Pr(Joe wins on 1st roll) + Pr(Joe wins on 3rd roll) + · · · = Pr(Joe hits on 1st roll) + Pr(Joe misses, Fred misses, Joe hits) + · · · = p + (1 − p)(1 − p)p + (1 − p)(1 − p)(1 − p)(1 − p)p + · · ·

= p

∑^ ∞

i=

(1 − p)^2 i

p 1 − (1 − p)^2

=

2 − p

  1. Consider two boxes. The first box contains one black marble and one white marble. The second box contains two blacks and one white. A box is selected at random and a marble is drawn at random from the selected box.

(a) Find Pr(the marble is black). Solution: Let B, W denote black and white respectively, and let I, II denote the selection of Box 1 and Box 2. We use the law of total probability to find

Pr(B) = Pr(B|I)Pr(I) + Pr(B|II)Pr(II)

=

(b) What is the probability that the marble was selected from the first box given that the marble is white? Solution: We use Bayes Theorem to find

Pr(I|W ) =

Pr(W |I)Pr(I) Pr(W |I)Pr(I) + Pr(W |II)Pr(II)

=

1 2 ·^

1 2 1 2 ·^

1 2 +^

1 3 ·^

1 2 = 3 / 5. 2

  1. A gambler has in his pocket a fair coin and a two-headed coin.

(a) He selects one at random, and when he flips it, it shows heads. What’s the probability that the coin is fair? Solution: Let F, U denote fair and unfair respectively. We use Bayes to find

Pr(F |H) =

Pr(H|F )Pr(F ) Pr(H|F )Pr(F ) + Pr(H|U )Pr(U )

=

1 2 ·^

1 2 1 2 ·^

1 2 + 1^ ·^

1 2 = 1 / 3. 2

(b) He flips the same coin and it again shows heads. Same question. Solution: As above,

Pr(F |HH) =

Pr(HH|F )Pr(F ) Pr(HH|F )Pr(F ) + Pr(HH|U )Pr(U )

=

1 4 ·^

1 2 1 4 ·^

1 2 + 1^ ·^

1 2 = 1 / 5. 2

(c) He flips it a third time and it shows tails. Same question. Solution: Pr(F |HHT ) = 1 (trivially!) 2

  1. (A tough problem!) 3 prisoners are informed by their jailer that one of them has been chosen at random to be executed, and the other 2 are to be freed. Prisoner A asks the jailer to tell him privately which of his fellow prisoners will be set free, claiming that there would be no harm in divulging this information, since he already knows that at least one will go free. The jailer refuses by arguing that if A knew, A’s probability of being executed would rise from 1/3 to 1/2 (i.e., there would only be 2 prisoners left). Whose reasoning is correct and why? Solution: Label the prisoners A,B,C. Without loss of generality, suppose the jailer says “It’s not B”, which we’ll denote by NB. What’s the conditional probability that A dies? By Bayes, we have Pr(A dies|Jailer says “It’s not B”)

=

Pr(Jailer says “It’s not B”|A dies)Pr(A dies) Pr(NB|A dies)Pr(A dies) + Pr(NB|B dies)Pr(B dies) + Pr(NB|C dies)Pr(C dies)

=

1 2 ·^

1 3 1 2 ·^

1 3 + 0^ ·^

1 3 + 1^ ·^

1 3

Thus, A is correct! 2