Professional Documents
Culture Documents
Problem No 2.28
A character considers of 3 binary bits. This is equivalent to tossing a coin 3 times and noting the
sequence of heads and tails.
The sample space 𝑆 could be
𝑆 = {000, 001, 010, 011, 100, 101, 110, 111}
1
There are 8 outcomes and each outcome has probability 8
(a)
4 1
𝑃[𝐴1 ] = 𝑃[{100, 101, 110, 111}] = =
8 2
2 1
𝑃[𝐴1 ⋂𝐴3 ] = 𝑃[{ 101, 111}] = =
8 4
1
𝑃[𝐴1 ⋂𝐴2 ⋂𝐴3 ] = 𝑃[{111}] =
8
𝑃[𝐴1 ⋃𝐴2 ⋃𝐴3 ] = 1 − 𝑃[(𝐴1 ⋃𝐴2 ⋃𝐴3 )𝑐 ] = 1 − 𝑃[𝐴1𝑐 ⋂𝐴𝑐2 ⋂𝐴𝑐3 ]
7
= 1 − 𝑃[{000}] =
8
Page 1 of 5
Problem No 2.38
Two numbers (𝑥, 𝑦) selected from the interval [0, 1]
(a) 𝑥, 𝑦 inside the unit circle
Area inside the circle
𝜋 𝜋
𝑃[𝑥 2 + 𝑦 2 ≤ 1] = (1)2 =
4 4
Page 2 of 5
Problem No 2.80
𝑃[𝐴] = 0.5, 𝑃[𝐵] = 0.1, 𝑃[𝐶] = 0.4
𝑃[def. |𝐴] = 0.005, 𝑃[def. |𝐵] = 0.001, 𝑃[def. |𝐶] = 0.01
Required: (a) 𝑃[𝐴|def. ], and (b) 𝑃[𝐶|def. ]
𝑃[Chip defective] = 𝑃[def. |𝐴]𝑃[𝐴] + 𝑃[def. |𝐵]𝑃[𝐵] + 𝑃[def. |𝐶]𝑃[𝐶]
= (0.005)(0.5) + (0.001)(0.1) + (0.01)(0.4)
= 6.6 × 10−3
Page 3 of 5
Problem No. 2.88
We use a tree to show the sequence of events. First, we choose an urn so 𝐴 or 𝐴𝑐 occur. Then,
the event that we select a ball 𝐵 or 𝐵 𝑐 occurs.
From the theorem on total probability:
𝑃[𝐵] = 𝑃[𝐵|𝐴]𝑃[𝐴] + 𝑃[𝐵|𝐴𝐶 ]𝑃[𝐴𝑐 ]
Page 4 of 5
Problem No. 2.98
Let 𝑁 be the number of defective items in a batch of 𝑛 items. Then 𝑁 has binomial probability
with parameters 𝑛 and 𝑝:
𝑛 𝑛!
𝑃[𝑁 = 𝑘] = ( ) 𝑝𝑘 (1 − 𝑝)𝑛−𝑘 = 𝑝𝑘 (1 − 𝑝)𝑛−𝑘
𝑘 𝑘! (𝑛 − 𝑘)!
(a)
𝑃[𝑁 > 1] = 1 − 𝑃[𝑁 ≤ 1] = 1 − 𝑃[𝑁 = 0] − 𝑃[𝑁 = 1]
= 1 − (1 − 𝑝)𝑛 − 𝑛(1 − 𝑝)𝑛−1 𝑝
(b)
𝑃 = 10−1 = 0.1, 𝑃[𝑁 > 0] = 1 − 𝑃[𝑁 ≤ 0] = 1 − (1 − 𝑝)𝑛 = 0.99. That is,
0.99 = 1 − (1 − 0.1)𝑛
0.01 = 0.9𝑛
ln 0.01 = 𝑛 ln 0.9
ln 0.01
𝑛= = 44 items
ln 0.9
(d) There are three outcomes: type 1 error, type 2 error and no error. From multinomial
probability law:
𝑛! 𝑘
𝑃[𝑘1 , 𝑘2 , 𝑛 − 𝑘1 − 𝑘2 ] = (𝑝𝛼)𝑘1 (𝑝(1 − 𝛼)) 2 (1 − 𝑝)𝑛−𝑘1−𝑘2
𝑘1 ! 𝑘2 ! (𝑛 − 𝑘1 − 𝑘2 )!
Page 5 of 5