SC222: Tutorial Sheet 3
SC222: Tutorial Sheet 3
where 0 < p ≤ 1 and we write symbolically X ∼ Geo(p). Geometric r.v. implies that
the occurrence of the first success requires k independent trials, each with success
X
probability p. If a r.v. X ∼ Geo 31 , then find the distribution function of Y = X+1
and hence determine its p.m.f.
Pb 4) In three independent tosses of a fair coin, let X denotes the number of tails appearing.
Let Y = X 2 and Z = 2X 2 + 1. Find the means of random variables Y and Z.
(a) For what values of p, a 5-component system more likely to operate effectively
than a 3-component system?
(b) In general, when is a 2k + 1−compnent system better than a 2k − 1−component
system?
Pb 6) Buses arrive at a specified stop at 15-minute intervals starting at 7 A.M. That is, they
arrive at 7, 7:15, 7:30, 7:45, and so on. If a passenger arrives at the stop at a time
that is uniformly distributed between 7 and 7:30, find the probability that he waits
(a) less than 5 minutes for a bus.
(b) at least 12 minutes for a bus.
Pb 8) A secretary has typed N letters along with their respective envelopes. The envelops
get mixed up when they fall on the floor. If the letters are placed in the mixed-up
envelops in a completely random manner (that is, each letter is equally likely to end
up in any of the envelopes), what is the expected number of letters that are placed in
the correct envelopes?
Pb 9) The joint PMF of a discrete random vector (X1 , X2 ) is given by the following table
x2 \ x1 −1 0 1
0 1/9 2/9 1/9
1 1/9 2/9 1/9
2 0 1/9 0