Question #66177

Consider a small post office with a single staff member operating a single postal
counter. Suppose that the probability pk, that there are k customers in the post
office, is given by pk = p0p^k k = 0,1,2,... where 0 < p < 1.
(a) Show that p0 = 1 - p.
(b) Determine the probability that a newly arriving customer has to wait to be
served.
1

Expert's answer

2017-03-14T15:28:05-0400

Answer on Question #66177 – Math – Statistics and Probability

Question

Consider a small post office with a single staff member operating a single postal counter.

Suppose that the probability pkp_k, that there are kk customers in the post office, is given by


pk=p0pk,k=0,1,2,,p_k = p_0 p^k, \quad k = 0, 1, 2, \dots,


where 0<p<10 < p < 1.

(a) Show that


p0=1p.p_0 = 1 - p.


(b) Determine the probability that a newly arriving customer has to wait to be served.

Solution

(a) Probabilities of all possible outcomes must sum up to 1, hence p0+p1++pn+=1p_0 + p_1 + \ldots + p_n + \ldots = 1.

Substituting formula for pk=p0pk,k=0,1,2,p_k = p_0 p^k, k = 0, 1, 2, \ldots, we can rewrite the previous sum p0+p0p++p0pn+=p0(1+p++pn+)p_0 + p_0 p + \ldots + p_0 p^n + \ldots = p_0 (1 + p + \ldots + p^n + \ldots).

If 0<p<10 < p < 1, then


1+p++pn+=11p1 + p + \ldots + p^n + \ldots = \frac{1}{1 - p}


by the formula for the sum of the infinite arithmetic progression.

It follows from the initial equation


p0+p1++pn+=p01p=1p_0 + p_1 + \ldots + p_n + \ldots = \frac{p_0}{1 - p} = 1


that


p0=1p.p_0 = 1 - p.


(b) Customer has to wait in case when there are some other customers in the office. The opposite to this event is 'no customer at the moment'. So


P(have to wait)=1P(k=0)=1p0=11+p=p.P(\text{have to wait}) = 1 - P(k = 0) = 1 - p_0 = 1 - 1 + p = p.


Answer:

(a) p0=1pp_0 = 1 - p;

(b) P(have to wait)=pP(\text{have to wait}) = p.

Answer provided by https://www.AssignmentExpert.com

Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

Comments

No comments. Be the first!
LATEST TUTORIALS
APPROVED BY CLIENTS