1.

2 letters can be chosen by 262 ways and 4 digit can be chosen by 104
ways. So total is 262 104 .
If repetition is not allowed, total is 26.25.10.9.8.7.
2. Let Ei (i = 1, 2, . . . , 10) denotes ith couple sit next to each other.
So the probability that no wife sits next to her husband is 1 − 10
S
i=1 Ei .
There are (20 − 1)! = 19! ways of sitting in a round table.
The number of arrangements that result in a specified set of n men
sitting next to their wives can most easily be obtained by first thinking
of each of the n married couples as being single entities. If this were
the case, then we would need to arrange 20−n entities around a round
table, and there are clearly (20 − n − 1)! such arrangements. Finally,
since each of the n married couples can be arranged next to each other
in one of two possible ways, it follows that there are 2n (20 − n − 1)!
arrangements that result in a specified set of n men each sitting next
to their wives.
2k (20 − k − 1)!
P (E1 E2 . . . Ek ) = , k = 1, 2, . . . , 10.
19!

By inclusion-exclusion principle,
10
[ 10
X X X
P( Ei ) = P (Ei )− P (Ei1 Ei2 )+. . .+(−1)n+1 P (Ei1 Ei2 . . . Ein )
i=1 i=1 1≤i1 <i2 ≤10 1≤i1 <i2 <...<in ≤10

−P (E1 E2 . . . E10 )

Therefore,
       
10 (18)! 10 2 17! 10 3 (16)! 10 10 9!
2 − 2 + 2 −...− 2 ≈ .6605
1 19! 2 19! 3 19! 10 19!
So the required probability is 1 − .6605 = 0.3395.
3. P(answer is correct)=P(answer is correct|he knows the answer)P(he
knows the answer)+P(answer is correct|he does not know the an-
swer)P(he does not know the answer)=1 × .75 + .25 × .25 = .8125.

4. Part 1.
(a)With replacement
(71)9
(100)10

(b)Without replacement
70.69.68 . . . 62
100.99 . . . 91

1
 Part2.
(a)With replacement
(47)9
(100)10

(b)Without replacement
45.44 . . . 38
100.99 . . . 91

5.
4

4
44


2 1 10
52


13

6. Since P (A1 ∩ A2 ∩ . . . ∩ An−1 ) > 0, each P (A1 ∩ A2 ∩ . . . ∩ Ak ) > 0 for

k = 1, 2, . . . n − 1.

P (A1 )P (A2 |A1 )P (A3 |A1 ∩ A2 ) . . . P (An |A1 ∩ A2 ∩ . . . ∩ An−1 )

P (A2 ∩ A1 ) P (A3 ∩ A2 ∩ A1 ) P (A1 ∩ A2 ∩ . . . ∩ An )

= P (A1 ) ...
P (A1 ) P (A2 ∩ A1 ) P (A1 ∩ A2 ∩ . . . ∩ An−1 )
= P (A1 ∩ A2 ∩ . . . ∩ An )

(95
3)
7. probability that none of the units are defective 100 .
(3)
8. Let Br be the event that rth vertex randomly selected in the surface
is blue.
1
P (Br ) =
10
for all r.
By Boole’s inequality,
8 8
[ X 8
P( Br ) ≤ P (Br ) =
10
r=1 r=1

Therefore at least 20 per cent of such cube have all vertices red.

9. first part:
1
4 1
2 =
4
2

Second part:
1
4 1
3 =
4
3
1 1 1 4
10. Here probability of choosing Box 1 is 6 + 6 = 3 and Box 2 is 6 = 23 .

2
 (a)
5 1
3.3
P (U1 |B1 ) = 5 2
7.3 + 53 . 13
( 58 )2 . 13
P (U1 |B1 ∩ B2 ) =
( 58 )2 . 13 + ( 57 )2 . 23
( 58 )n . 13
P (U1 | ∩ni=1 Bi ) = 5 n 1
( 8 ) . 3 + ( 57 )n . 32
taking limit n → ∞ in both side, we get 0.

T event B1 B2 . . . Bn approches to the null set as n → ∞,

(b) Since the
P (U1 | ∞
i=1 Bi ) is not defined.
(c)
P (B1 B2 |U1 )P (U1 ) + P (B1 B2 |U2 )P (U2 )
P (B2 |B1 ) = )
P (B1 |U1 )P (U1 ) + P (B1 |U2 )P (U2 )

( 85 )2 . 13 + ( 57 )2 . 32
= 5 2 5 1
7.3 + 3.3

( 58 )n+1 . 31 + ( 57 )n+1 . 23
P (Bn+1 | ∩ni=1 Bi ) =
( 75 )n . 32 + ( 53 )n . 13

and
lim P (Bn+1 | ∩ni=1 Bi ) = 1
n→∞

(d)
P (B1 B2 ) 6= P (B1 )P (B2 )

hence not independent.

11. First part:

P (A|B c ) = P (A|B)
P (AB c P (AB)
=
1 − P (B) P (B)
P (AB) = P (A)P (B)
Hence independent.
Second part:

P (Ac B c ) = 1−P (A∪B) = 1−(P (A)+P (B)−P (A)P (B)) = P (Ac )P (B c )

Hence independent.

3
12. Let A be the event that sum of two dice is 7. So
6
P (A) =
36
and B be the event that the score of first die is i (say), i = 1, 2, . . . , 6.
1
P (B) =
6
1
P (AB)=P (Score of first die is i and second die is (7 − i))= 36 =
P (A)P (B).
Hence independent.
1
13. P (A Person has the disease)= 10000 .
P (A person is diagnosed as positive|Person does not have the disease)=
2
100 .
1
P (A person is diagnosed as negative| Person has the disease)= 100 .
P (A person has the disease|he is diagnosed as positive)=
99 1
100 . 10000
= 99 1 2 9999 ≈ .005
100 . 10000 + 100 . 10000

14. The required probability is

(18)! 1 18
( ) (multinomial distribution).
(3!)6 6

15. Let us denote by Ei , i = 1, 2, . . . N the event that the ith person has
his own hat.
Let n persons have their own hats. Then in (N − n)! possible ways;
the remaining N − n person can select any of N − n hats.
Hence, assuming that all N ! possible outcomes are equally likely, we
see that
(N − n)!
P (E1 E2 . . . En ) = , n = 1, 2, . . . N.
N!
By inclusion exclusion theorem,
The required probability
n
[ 1 1 1
P( Ei ) = 1 − + − . . . + (−1)N +1
2! 3! N!
i=1

16. Let FA , FB , FC be the event that prisoners A, B, C will be freed re-

spectively and WB be the event that the warden tells A that prisoner
B is to be executed.
The required probability is
P (WB |FA )P (FA )
P (FA |WB ) =
P (WB |FA )P (FA ) + P (WB |FB )P (FB ) + P (WB |FC )P (FC )

4
 1 1
2.3
= 1 1
2.3 + 0. 13 + 1. 13
1
=
3
17. Let E denote the event that A ends up with all the money when he
starts with i and B starts with N −i, and to make clear the dependence
on the initial fortune of A, let P (E) = Pi . Clearly P0 = 0, PN = 1.
Let H denote the event that the first flip lands on heads; then

P (E) = Pi = P (E|H)P (H) + P (E|H c )P (H c )

= Pi+1 p + Pi−1 q, q = 1 − p
q
Pi+1 − Pi = (Pi − Pi−1 ), for i = 1, 2, . . . N − 1
p
More generally
q
Pi+1 − Pi = ( )i P1 , since P0 = 0.
p
Thus

i
X q
Pi+1 − P1 = ( )k P1
p
k=1
i
X q
Pi+1 = ( )k P1 (1)
p
k=0

1−( pq )i+1
P1 , q 6= p

= 1− pq (2)
 (i + 1)P , q=p
1

where
1− pq
(
1−( pq )N
, q 6= p
P1 =
1
N, q = p = .5