THE UNIVERSITY OF HONG KONG
DEPARTMENT OF MATHEMATICS
MATH3603: Probability Theory
13 May 2026
2:30 pm - 5:00 pm
Only approved calculators as announced by the Examinations Secretary can be used in this
examination. It is candidates’ responsibility to ensure that their calculator operates satisfactorily,
and candidates must record the name and type of the calculator used on the front page of the
examination script.
Answer ALL FIVE questions
Note: You should always give precise and adequate explanations to support your conclusions,
except where otherwise stated. Clarity of presentation of your argument counts. So think
carefully before you write.
P.1 of 3
1. (20 points) Decide whether each of the following statements is true or false. No justification
is required.
(a) If E[X | Y ] = E[X], then X and Y are independent.
(b) If a Markov chain is irreducible and has a stationary distribution, then it must be
positive recurrent.
(c) If X and Y are Gaussian random variables and Cov(X, Y ) = 0, then X and Y are
independent.
(d) Suppose 0 < P(B) < 1. If
P(A | B) = P(A | B c ),
then A and B are independent.
2. (20 points) Let N be the total number of dice thrown. For each i ≥ 1, let Ai be the event
that exactly i dice are thrown, with
P(Ai ) = p(1 − p)i−1 ,
i = 1, 2, . . . ,
where 0 < p < 1. Conditional on Ai , suppose that i independent fair six-sided dice are thrown.
Denote the total score by S. Find the following probabilities.
(a) The total score is 3, given that N is even.
(b) Exactly two dice are thrown, given that the total score is 3 and the first die is 1.
(c) The largest outcome among all N dice is r, where r = 1, 2, . . . , 6.
3. (10 points) Let X and Y be independent standard Gaussian random variables. Their
common density is
1
2
f (x) = √ e−x /2 ,
−∞ < x < ∞.
2π
Define
U = aX + bY,
V = cX + dY,
where ad − bc ̸= 0.
(a) Find the joint probability density function of (U, V ).
(b) Under what condition on a, b, c, d are U and V independent?
4.
(25 points) Consider a Markov chain with state space
S = {1, 2, 3, 4, 5, 6}
P.2 of 3
and transition matrix
1
2
0
0
1
P = 3
0
0
0
0
0
1
4
1
2
0
0 0
2
3 0
0 0
0 1
1
4 0
1
2
1
2
0
0
0
1
0
0
0
1
2
0
.
0
0
0
(a) Write down all communicating classes. For each class, state whether it is recurrent or
transient.
(b) For the recurrent states, state the period of each state.
(c) For transient states i, j, let
sij = Ei
"∞
X
#
1{Xn =j}
n=0
be the expected total number of visits to state j, given that the Markov chain starts
from state i. Find all sij for transient states i, j.
(d) For the recurrent classes, determine whether the limiting distribution exists. Explain
your reasoning. If a limiting distribution exists, state the distribution.
5. (25 points) Let X1 , X2 , . . . , Xn be independent and identically distributed Uniform(0, 1)
random variables. For 1 ≤ k ≤ n, define
Yk = min Xi .
1≤i≤k
(a) Find the distribution function of Yk .
(b) Find E[Yk ] and Var(Yk ).
(c) For i < j, find Cov(Yi , Yj ).
Hint: You may use the Beta integral directly:
Z 1
xα−1 (1 − x)β−1 dx =
0
Γ(α)Γ(β)
,
Γ(α + β)
α, β > 0.
In particular, for nonnegative integers m, n,
Z 1
0
xm (1 − x)n dx =
m! n!
.
(m + n + 1)!
END OF PAPER
P.3 of 3