没有合适的资源?快使用搜索试试~ 我知道了~
首页prob-solved-2ndedition(概率导论第2版答案)
prob-solved-2ndedition(概率导论第2版答案)
5星 · 超过95%的资源 需积分: 50 60 下载量 91 浏览量
更新于2023-03-16
评论 5
收藏 1.48MB PDF 举报
prob-solved-2ndedition(概率导论第2版答案) prob-solved-2ndedition(概率导论第2版答案)
资源详情
资源评论
资源推荐
Introduction to Probability
2nd Edition
Problem Solutions
(last updated: 10/22/13)
c
Dimitri P. Bertsekas and John N. Tsitsiklis
Massachusetts Institute of Technology
WWW site for book information and orders
http://www.athenasc.com
Athena Scientific, Belmont, Massachusetts
1
C H A P T E R 1
Solution to Problem 1.1. We have
A = {2, 4, 6}, B = {4, 5, 6},
so A ∪ B = {2, 4, 5, 6}, and
(A ∪ B)
c
= {1, 3}.
On the other hand,
A
c
∩ B
c
= {1, 3, 5} ∩ {1, 2, 3} = {1, 3}.
Similarly, we have A ∩B = {4, 6}, and
(A ∩ B)
c
= {1, 2, 3, 5}.
On the other hand,
A
c
∪ B
c
= {1, 3, 5} ∪ {1, 2, 3} = {1, 2, 3, 5}.
Solution to Problem 1.2. (a) By using a Venn diagram it can be seen that for any
sets S and T , we have
S = (S ∩ T ) ∪ (S ∩ T
c
).
(Alternatively, argue that any x must belong to either T or to T
c
, so x belongs to S
if and only if it belongs to S ∩ T or to S ∩ T
c
.) Apply this equality with S = A
c
and
T = B, to obtain the first relation
A
c
= (A
c
∩ B) ∪ (A
c
∩ B
c
).
Interchange the roles of A and B to obtain the second relation.
(b) By De Morgan’s law, we have
(A ∩ B)
c
= A
c
∪ B
c
,
and by using the equalities of part (a), we obtain
(A∩B)
c
=
(A
c
∩B)∪(A
c
∩B
c
)
∪
(A∩B
c
)∪(A
c
∩B
c
)
= (A
c
∩B)∪(A
c
∩B
c
)∪(A∩B
c
).
(c) We have A = {1, 3, 5} and B = {1, 2, 3}, so A ∩ B = {1, 3}. Therefore,
(A ∩ B)
c
= {2, 4, 5, 6},
2
and
A
c
∩ B = {2}, A
c
∩ B
c
= {4, 6}, A ∩ B
c
= {5}.
Thus, the equality of part (b) is verified.
Solution to Problem 1.5. Let G and C be the events that the chosen student is
a genius and a chocolate lover, respectively. We have P(G) = 0.6, P(C) = 0.7, and
P(G ∩C) = 0.4. We are interested in P(G
c
∩C
c
), which is obtained with the following
calculation:
P(G
c
∩C
c
) = 1−P(G∪C) = 1−
P(G)+P(C)−P(G∩C)
= 1−(0.6+0.7−0.4) = 0.1.
Solution to Problem 1.6. We first determine the probabilities of the six possible
outcomes. Let a = P({1}) = P({3}) = P({5}) and b = P({2}) = P({4}) = P({6}).
We are given that b = 2a. By the additivity and normalization axioms, 1 = 3a + 3b =
3a + 6a = 9a. Thus, a = 1/9, b = 2/9, and P({1, 2, 3}) = 4/9.
Solution to Problem 1.7. The outcome of this experiment can be any finite sequence
of the form (a
1
, a
2
, . . . , a
n
), where n is an arbitrary positive integer, a
1
, a
2
, . . . , a
n−1
belong to {1, 3}, and a
n
belongs to {2, 4}. In addition, there are possible outcomes
in which an even number is never obtained. Such outcomes are infinite sequences
(a
1
, a
2
, . . .), with each element in the sequence belonging to {1, 3}. The sample space
consists of all possible outcomes of the above two types.
Solution to Problem 1.8. Let p
i
be the probability of winning against the opponent
played in the ith turn. Then, you will win the tournament if you win against the 2nd
player (probability p
2
) and also you win against at least one of the two other players
[probability p
1
+ (1 − p
1
)p
3
= p
1
+ p
3
− p
1
p
3
]. Thus, the probability of winning the
tournament is
p
2
(p
1
+ p
3
− p
1
p
3
).
The order (1, 2, 3) is optimal if and only if the above probability is no less than the
probabilities corresponding to the two alternative orders, i.e.,
p
2
(p
1
+ p
3
− p
1
p
3
) ≥ p
1
(p
2
+ p
3
− p
2
p
3
),
p
2
(p
1
+ p
3
− p
1
p
3
) ≥ p
3
(p
2
+ p
1
− p
2
p
1
).
It can be seen that the first inequality above is equivalent to p
2
≥ p
1
, while the second
inequality above is equivalent to p
2
≥ p
3
.
Solution to Problem 1.9. (a) Since Ω = ∪
n
i=1
S
i
, we have
A =
n
[
i=1
(A ∩ S
i
),
while the sets A ∩ S
i
are disjoint. The result follows by using the additivity axiom.
(b) The events B ∩ C
c
, B
c
∩ C, B ∩ C, and B
c
∩ C
c
form a partition of Ω, so by part
(a), we have
P(A) = P(A ∩ B ∩ C
c
) + P(A ∩ B
c
∩ C) + P(A ∩ B ∩ C) + P(A ∩ B
c
∩ C
c
). (1)
3
The event A ∩B can be written as the union of two disjoint events as follows:
A ∩ B = (A ∩ B ∩ C) ∪ (A ∩ B ∩ C
c
),
so that
P(A ∩ B) = P(A ∩ B ∩ C) + P(A ∩ B ∩ C
c
). (2)
Similarly,
P(A ∩ C) = P(A ∩ B ∩ C) + P(A ∩ B
c
∩ C). (3)
Combining Eqs. (1)-(3), we obtain the desired result.
Solution to Problem 1.10. Since the events A ∩ B
c
and A
c
∩ B are disjoint, we
have using the additivity axiom repeatedly,
P
(A∩B
c
)∪(A
c
∩B)
= P(A∩B
c
)+P(A
c
∩B) = P(A)−P(A∩B)+P(B)−P(A∩B).
Solution to Problem 1.14. (a) Each possible outcome has probability 1/36. There
are 6 possible outcomes that are doubles, so the probability of doubles is 6/36 = 1/6.
(b) The conditioning event (sum is 4 or less) consists of the 6 outcomes
(1, 1), (1, 2), (1, 3), (2, 1), (2, 2), (3, 1)
,
2 of which are doubles, so the conditional probability of doubles is 2/6 = 1/3.
(c) There are 11 possible outcomes with at least one 6, namely, (6, 6), (6, i), and (i, 6),
for i = 1, 2, . . . , 5. Thus, the probability that at least one die is a 6 is 11/36.
(d) There are 30 possible outcomes where the dice land on different numbers. Out of
these, there are 10 outcomes in which at least one of the rolls is a 6. Thus, the desired
conditional probability is 10/30 = 1/3.
Solution to Problem 1.15. Let A be the event that the first toss is a head and
let B be the event that the second toss is a head. We must compare the conditional
probabilities P(A ∩ B |A) and P(A ∩ B |A ∪ B). We have
P(A ∩ B |A) =
P
(A ∩ B) ∩ A
P(A)
=
P(A ∩ B)
P(A)
,
and
P(A ∩ B |A ∪ B) =
P
(A ∩ B) ∩ (A ∪ B)
P(A ∪ B)
=
P(A ∩ B)
P(A ∪ B)
.
Since P(A ∪ B) ≥ P(A), the first conditional probability above is at least as large, so
Alice is right, regardless of whether the coin is fair or not. In the case where the coin
is fair, that is, if all four outcomes HH, HT , T H, T T are equally likely, we have
P(A ∩ B)
P(A)
=
1/4
1/2
=
1
2
,
P(A ∩ B)
P(A ∪ B)
=
1/4
3/4
=
1
3
.
A generalization of Alice’s reasoning is that if A, B, and C are events such that
B ⊂ C and A ∩ B = A ∩ C (for example, if A ⊂ B ⊂ C), then the event A is at least
4
as likely if we know that B has occurred than if we know that C has occurred. Alice’s
reasoning corresponds to the special case where C = A ∪ B.
Solution to Problem 1.16. In this problem, there is a tendency to reason that since
the opposite face is either heads or tails, the desired probability is 1/2. This is, however,
wrong, because given that heads came up, it is more likely that the two-headed coin
was chosen. The correct reasoning is to calculate the conditional probability
p = P(two-headed coin was chosen |heads came up)
=
P(two-headed coin was chosen and heads came up)
P(heads came up)
.
We have
P(two-headed coin was chosen and heads came up) =
1
3
,
P(heads came up) =
1
2
,
so by taking the ratio of the above two probabilities, we obtain p = 2/3. Thus, the
probability that the opposite face is tails is 1 − p = 1/3.
Solution to Problem 1.17. Let A be the event that the batch will be accepted.
Then A = A
1
∩ A
2
∩ A
3
∩ A
4
, where A
i
, i = 1, . . . , 4, is the event that the ith item is
not defective. Using the multiplication rule, we have
P(A) = P(A
1
)P(A
2
|A
1
)P(A
3
|A
1
∩A
2
)P(A
4
|A
1
∩A
2
∩A
3
) =
95
100
·
94
99
·
93
98
·
92
97
= 0.812.
Solution to Problem 1.18. Using the definition of conditional probabilities, we
have
P(A ∩ B |B) =
P(A ∩ B ∩ B)
P(B)
=
P(A ∩ B)
P(B)
= P(A |B).
Solution to Problem 1.19. Let A be the event that Alice does not find her paper
in drawer i. Since the paper is in drawer i with probability p
i
, and her search is
successful with probability d
i
, the multiplication rule yields P(A
c
) = p
i
d
i
, so that
P(A) = 1 − p
i
d
i
. Let B be the event that the paper is in drawer j. If j 6= i, then
A ∩ B = B, P(A ∩ B) = P(B), and we have
P(B |A) =
P(A ∩ B)
P(A)
=
P(B)
P(A)
=
p
j
1 − p
i
d
i
.
Similarly, if i = j, we have
P(B |A) =
P(A ∩ B)
P(A)
=
P(B)P(A |B)
P(A)
=
p
i
(1 − d
i
)
1 − p
i
d
i
.
Solution to Problem 1.20. (a) Figure 1.1 provides a sequential description for the
three different strategies. Here we assume 1 point for a win, 0 for a loss, and 1/2 point
5
剩余132页未读,继续阅读
ly469
- 粉丝: 1
- 资源: 6
上传资源 快速赚钱
- 我的内容管理 收起
- 我的资源 快来上传第一个资源
- 我的收益 登录查看自己的收益
- 我的积分 登录查看自己的积分
- 我的C币 登录后查看C币余额
- 我的收藏
- 我的下载
- 下载帮助
会员权益专享
最新资源
- ExcelVBA中的Range和Cells用法说明.pdf
- 基于单片机的电梯控制模型设计.doc
- 主成分分析和因子分析.pptx
- 共享笔记服务系统论文.doc
- 基于数据治理体系的数据中台实践分享.pptx
- 变压器的铭牌和额定值.pptx
- 计算机网络课程设计报告--用winsock设计Ping应用程序.doc
- 高电压技术课件:第03章 液体和固体介质的电气特性.pdf
- Oracle商务智能精华介绍.pptx
- 基于单片机的输液滴速控制系统设计文档.doc
- dw考试题 5套.pdf
- 学生档案管理系统详细设计说明书.doc
- 操作系统PPT课件.pptx
- 智慧路边停车管理系统方案.pptx
- 【企业内控系列】企业内部控制之人力资源管理控制(17页).doc
- 温度传感器分类与特点.pptx
资源上传下载、课程学习等过程中有任何疑问或建议,欢迎提出宝贵意见哦~我们会及时处理!
点击此处反馈
安全验证
文档复制为VIP权益,开通VIP直接复制
信息提交成功
评论2