题目
Problem
Sam is a telephone sales representative. For each call to a customer
• Sam either makes a sale or does not make a sale
• sales are made independently
Past records show that, for each call to a customer, the probability that Sam makes a sale is 0.2
(a) Find the probability that Sam makes
(i) exactly 2 sales in 14 calls,
(ii) more than 3 sales in 25 calls.
(4)
Sam makes n calls each day.
(b) Find the minimum value of n
(i) so that the expected number of sales each day is at least 6
(2)
(ii) so that the probability of at least 1 sale in a randomly selected day exceeds 0.95
(4)
(Total for Question 1 is 10 marks)
题目中文翻译
山姆是一名电话销售代表。对于给客户的每次通话
• 山姆要么成交要么未成交
• 销售是独立进行的
过去的记录显示,对于给客户的每次通话,山姆成交的概率为 0.2
(a) 求山姆在以下情况成交的概率
(i) 在 14 次通话中恰好成交 2 次,
(ii) 在 25 次通话中成交超过3 次。
山姆每天打 n 次电话。
(b) 求最小的 n 值
(i) 使得每天的预期成交数至少为6
(ii) 使得随机选择的一天中至少成交 1 次的概率超过 0.95
(第 1 题共 10 分)
解答
(a)(i)
解法一
思路
展开
每次通话是否成交相互独立,而且每次成交概率固定为 0.2,所以 14 次通话中的成交次数服从二项分布。要求恰好成交 2 次,直接使用二项分布的单点概率公式。
答题过程
展开
Let X be the number of sales in 14 calls. Then
X∼B(14,0.2).
Therefore,
P(X=2)===(214)(0.2)2(0.8)120.250138…0.2501.
(a)(ii)
解法一
思路
展开
25 次通话中的成交次数同样服从二项分布。题目要求“超过 3 次”,即 P(X>3);计算其补事件 P(X⩽3) 更简洁。
答题过程
展开
Let X be the number of sales in 25 calls. Then
X∼B(25,0.2).
Hence,
P(X>3)====1−P(X⩽3)1−0.233993…0.766006…0.766.
Equivalently, the cumulative probability being subtracted is
P(X⩽3)=r=0∑3(r25)(0.2)r×(0.8)25−r.
(b)(i)
解法一
思路
展开
每天 n 次通话的成交次数服从 B(n,0.2),其期望为 np=0.2n。将“至少为 6”写成不等式,并取满足条件的最小整数。
答题过程
展开
Let Y be the number of sales in one day. Then
Y∼B(n,0.2)
and
E(Y)=0.2n.
We require
0.2n⩾n⩾6,30.
Therefore, the minimum value is
n=30.
(b)(ii)
解法一
思路
展开
“至少成交 1 次”的补事件是“一次也没有成交”。一天内没有成交的概率为 0.8n,因此先把条件化为 0.8n<0.05,再取对数求整数下界。由于 ln0.8<0,相除时不等号方向要反转。
答题过程
展开
We require
P(Y⩾1)>0.95.
Using the complementary event,
1−P(Y=0)>1−(0.8)n>(0.8)n<0.95,0.95,0.05.
Taking logarithms, and noting that ln0.8<0,
nln0.8<n>>ln0.05,ln0.8ln0.0513.425…
Since n must be an integer, the minimum possible value is
n=14.
Indeed,
0.813=0.05497…>0.05
but
0.814=0.04398…<0.05,
which confirms that 14 is the minimum.