12 original exam-style questions - 4 pages of questions with a full mark scheme - free printable PDF.
Original content written for Revision Library.
For X ~ Po(lambda), P(X = x) = e^(-lambda) * lambda^x / x!, for x = 0, 1, 2, ..., with E(X) = lambda and Var(X) = lambda. If X ~ Po(lambda1) and Y ~ Po(lambda2) are independent, then X + Y ~ Po(lambda1 + lambda2).
For X ~ Geo(p), the number of independent trials up to and including the first success (write q = 1 - p), P(X = x) = q^(x-1) * p, for x = 1, 2, 3, ..., with E(X) = 1/p and Var(X) = q/p^2. The geometric distribution has the memoryless property: P(X > m+n | X > m) = P(X > n) for positive integers m and n.
For X ~ NB(r, p), the number of independent trials up to and including the rth success, P(X = x) = C(x-1, r-1) * p^r * q^(x-r), for x = r, r+1, r+2, ..., with E(X) = r/p and Var(X) = rq/p^2. X can be written as the sum of r independent Geo(p) random variables.
The probability generating function of a discrete random variable X taking non-negative integer values is G_X(t) = E(t^X) = sum of P(X = x) * t^x. It satisfies G_X(1) = 1, E(X) = G_X'(1), and Var(X) = G_X''(1) + G_X'(1) - [G_X'(1)]^2. If X and Y are independent random variables, then G_(X+Y)(t) = G_X(t) * G_Y(t).