题目
Sajid is practising for a long jump competition. He counts any jump that is longer than as a success. On any day, the probability that he has a success with his first jump is 0.2. For any subsequent jump, the probability of a success is 0.3 if the previous jump was a success and 0.1 otherwise. Sajid makes three jumps.
(a) Draw a tree diagram to illustrate this information, showing all the probabilities.
(b) Find the probability that Sajid has exactly one success given that he has at least one success.
On another day, Sajid makes six jumps.
(c) Find the probability that only his first three jumps are successes or only his last three jumps are successes.
题目中文翻译
Sajid 正在为跳远比赛练习。他把任何超过 的跳跃视为成功。无论哪一天,他第一次跳跃成功的概率均为 0.2。对于之后的每次跳跃,如果前一次跳跃成功,则本次成功的概率为 0.3;否则为 0.1。Sajid 跳跃三次。
(a) 画出树状图来表示这些信息,并标出所有概率。
(b) 已知 Sajid 至少成功一次,求他恰好成功一次的概率。
另一天,Sajid 跳跃六次。
(c) 求只有前三次跳跃成功或只有后三次跳跃成功的概率。
原卷通用作答要求
Answer all questions. You should use a calculator where appropriate.
You must show all necessary working clearly; no marks will be given for unsupported answers from a calculator.
Give non-exact numerical answers correct to 3 significant figures, or 1 decimal place for angles in degrees, unless a different level of accuracy is specified in the question.
请回答所有题目。适当时应使用计算器。必须清楚展示所有必要的计算过程;仅给出计算器答案而没有过程,不予评分。除非题目另有精度要求,非精确数值答案保留 3 位有效数字,以度为单位的角度保留 1 位小数。
解答
(a)
解法一
思路
展开
第一次成功率0.2;之后各层只看上一跳成功还是失败,不能当独立同分布。
答题过程
展开
Use for success and for failure. On the first jump, the branches have probabilities and .
For each of the second and third jumps:
- From any branch, use for and for .
- From any branch, use for and for .
Draw all three stages and label every outcome and branch probability.
(b)
解法一
思路
展开
恰一次成功有三条路径;至少一次成功用FFF的补集,最后作条件概率。
答题过程
展开
For exactly one success,
| Path | Probability |
|---|---|
Thus the probability of exactly one success is .
The probability of at least one success is
Therefore
(c)
解法一
思路
展开
只有前三或后三成功,分别就是SSSFFF、FFFSSS,不包含其他路径。
答题过程
展开
The two required paths are disjoint:
Hence