Grinstead-Snell-Probability · Problem 10.3.8

Markov Chains

Mathematics · moment-generating-functions-continuous

Problem

Let X1,X2,…,XnX_1, X_2, \ldots, X_n be an independent trials process with uniform density. Find the moment generating function for (a) X1X_1. (b) S2=X1+X2S_2 = X_1 + X_2. (c) Sn=X1+X2+⋯+XnS_n = X_1 + X_2 + \cdots + X_n. (d) An=Sn/nA_n = S_n/n. (e) Sn∗=(Sn−nμ)/nσ2S_n^* = (S_n - n\mu)/\sqrt{n\sigma^2}.
Intuitive explanation

The moment generating function (MGF) is a powerful tool that encodes all moments of a distribution into a single function. For sums of independent random variables, the key insight is that MGFs multiply: if XX and YY are independent, then MX+Y(t)=MX(t)⋅MY(t)M_{X+Y}(t) = M_X(t) \cdot M_Y(t). This transforms the problem of finding distributions of sums into simple algebra. Start by finding the MGF of a single uniform random variable, then use independence to build up to sums and transformations.

Intuitive explanation

The moment generating function (MGF) is a powerful tool that encodes all moments of a distribution into a single function. For sums of independent random variables, the key insight is that MGFs multiply: if XX and YY are independent, then MX+Y(t)=MX(t)⋅MY(t)M_{X+Y}(t) = M_X(t) \cdot M_Y(t). This transforms the problem of finding distributions of sums into simple algebra. Start by finding the MGF of a single uniform random variable, then use independence to build up to sums and transformations.

Related theory

Browse the problem library