How To Calculate Mgf Of A Dicrete Random Variable

Use this interactive calculator to compute the moment generating function, or MGF, for a discrete random variable from its support values and probabilities. Enter the outcomes, the probability mass function, and one or more t-values to evaluate M_X(t) = E[e^tX].

Expert Guide: How to Calculate MGF of a Dicrete Random Variable

The moment generating function, usually abbreviated as MGF, is one of the most useful tools in probability theory. If you are learning how to calculate the MGF of a dicrete random variable, the core idea is simpler than it first appears. For a discrete random variable X with possible values x₁, x₂, …, x_n and corresponding probabilities p₁, p₂, …, p_n, the MGF is defined by

M_X(t) = E[e^tX]] = Σ e^tx_i p_i

In plain language, you multiply each probability by e raised to t times the value of the random variable, then add all those terms together. That sum gives the value of the MGF at a chosen t. If you evaluate the function for several values of t, you can understand how the distribution behaves and, under appropriate conditions, recover moments such as the mean and variance.

Important concept: The MGF does not just summarize one number. It is a function of t. So the goal is usually not to find only M_X(1), but to derive the full expression M_X(t) or evaluate it across a range of t-values.

Why the MGF matters

The MGF is valuable because derivatives of M_X(t) at t = 0 produce moments of the random variable. In particular:

• M_X(0) = 1 whenever the MGF exists.
• M′_X(0) = E[X], the mean.
• M″_X(0) = E[X²].
• Var(X) = M″_X(0) – (M′_X(0))².

This makes the MGF especially useful in statistics, actuarial science, reliability modeling, operations research, queueing, and applied probability. It turns discrete sums into a function that can be differentiated and compared across distributions.

Step by step method for a discrete random variable

1. List the support values. Write down each possible value that X can take.
2. Write the probability for each value. Check that each probability is between 0 and 1 and that the total probability sums to 1.
3. Form the expression e^tX. For each support value x_i, replace X by x_i, giving e^tx_i.
4. Multiply by probabilities. Compute p_ie^tx_i for each term.
5. Add all terms. The sum is the MGF: M_X(t) = Σ p_ie^tx_i.
6. Optional: simplify. If possible, factor the result into a more compact expression.

Example 1: Bernoulli random variable

Suppose X takes value 1 with probability p and 0 with probability 1 – p. Then

• P(X = 0) = 1 – p
• P(X = 1) = p

Apply the definition:

M_X(t) = E[e^tX] = e^0t(1 – p) + e^1tp = (1 – p) + pe^t

This is one of the most famous MGF formulas in probability. It also connects naturally to the binomial distribution because the binomial can be viewed as a sum of independent Bernoulli variables.

Example 2: Fair die

Let X be the result of rolling a fair six-sided die. Then X can be 1, 2, 3, 4, 5, or 6, each with probability 1/6. The MGF is

M_X(t) = (1/6)(e^t + e^2t + e^3t + e^4t + e^5t + e^6t)

You can leave the answer in this summation form or use a geometric-series style simplification if desired. In many courses, the unsimplified form is perfectly acceptable because it clearly follows the definition.

Example 3: A custom two-point distribution

Assume X takes values -1 and 2 with probabilities 0.4 and 0.6. Then

M_X(t) = 0.4e^-t + 0.6e^2t

This example illustrates that a discrete random variable does not need to start at zero or use only positive integers. The support can include negative values, unequal spacing, or any countable set for which the expectation exists.

How to use derivatives to find moments

One reason students are asked to calculate MGFs is that they provide moments efficiently. Once you have an expression for M_X(t), differentiate it with respect to t.

For the two-point example above:

• M_X(t) = 0.4e^-t + 0.6e^2t
• M′_X(t) = -0.4e^-t + 1.2e^2t
• M″_X(t) = 0.4e^-t + 2.4e^2t

Now evaluate at t = 0:

• M′_X(0) = -0.4 + 1.2 = 0.8 = E[X]
• M″_X(0) = 0.4 + 2.4 = 2.8 = E[X²]
• Var(X) = 2.8 – 0.8² = 2.16

This matches the direct computation from the probability mass function, which confirms the method.

Common mistakes when calculating the MGF

• Using x instead of t. The MGF is a function of t, not of x.
• Forgetting the exponential. The formula is not Σ tx_ip_i. It is Σ e^tx_ip_i.
• Mixing up values and probabilities. Your x-values and probabilities must align term by term.
• Ignoring probability checks. If probabilities do not sum to 1, your input is not a valid PMF.
• Assuming all MGFs exist for all t. Some random variables only have MGFs on a restricted interval around 0. For most finite discrete distributions, the MGF exists for all real t.

How finite discrete distributions compare

For finite-support discrete variables, the MGF is always easy to construct because you are summing a finite number of exponential terms. The table below compares some common cases.

Distribution	Support	MGF	Mean	Variance
Bernoulli(p)	0, 1	(1 – p) + pe^t	p	p(1 – p)
Binomial(n, p)	0 to n	(1 – p + pe^t)^n	np	np(1 – p)
Poisson(λ)	0, 1, 2, …	exp(λ(e^t – 1))	λ	λ
Geometric(p), trials-until-first-success form	1, 2, 3, …	pe^t / (1 – (1 – p)e^t)	1/p	(1 – p)/p^2

These are standard formulas found in mathematical statistics texts. Notice that finite-support distributions produce finite sums, while infinite-support distributions often simplify to closed-form expressions using series methods.

Data table: real benchmark probabilities from a fair die

A fair die is a useful empirical benchmark because each outcome has the same exact probability, 1/6, which is approximately 0.1667. The table below shows the exact PMF and the MGF contribution for each outcome before summation.

Outcome x	Probability P(X = x)	Contribution to MX(t)
1	0.1667	(1/6)e^t
2	0.1667	(1/6)e^2t
3	0.1667	(1/6)e^3t
4	0.1667	(1/6)e^4t
5	0.1667	(1/6)e^5t
6	0.1667	(1/6)e^6t

Practical interpretation of the MGF

Students often ask what the MGF means intuitively. One useful way to think about it is that the MGF applies an exponential weighting scheme to the outcomes. Positive t-values magnify larger x-values more heavily because e^tx grows quickly as x increases. Negative t-values emphasize smaller outcomes instead. That is why plotting M_X(t) across several t-values can reveal how concentrated or spread out a distribution is.

• M(0) should equal 1
• Positive t emphasizes upper-tail values
• Negative t emphasizes lower-tail values
• Derivatives at 0 reveal moments
• Finite support means straightforward computation

When the MGF exists and when to be careful

For finite discrete random variables, the MGF exists for every real t because the sum has only finitely many exponential terms. For infinite discrete distributions such as geometric or Poisson, the MGF still often exists, but the domain may be restricted. For example, the geometric MGF exists only when the relevant infinite series converges. In a classroom setting, your instructor may ask you to state the interval of t for which the expression is valid.

How this calculator helps

This calculator automates the exact definition of the MGF for a discrete random variable. After you enter the support values and probabilities, it checks whether the PMF is valid, computes the mean and variance directly, and evaluates M_X(t) at the t-values you provide. It also graphs either the MGF or the log MGF to make the function easier to interpret visually.

That is especially useful in these situations:

• Checking homework answers for finite discrete distributions
• Comparing multiple candidate PMFs
• Testing how M_X(t) changes as t moves away from zero
• Verifying that M(0) = 1
• Estimating moments by understanding derivatives near zero

Authoritative references for further study

If you want formal probability notes and mathematically rigorous background, these academic and government resources are useful:

• University of California, Berkeley probability notes
• Penn State STAT 414 probability theory course materials
• National Institute of Standards and Technology, a U.S. government scientific standards resource

Final takeaway

To calculate the MGF of a dicrete random variable, start with the definition M_X(t) = Σ p(x)e^tx. Then substitute each support value, multiply by its probability, and sum the terms. For a finite PMF, this method is direct and exact. Once you have the MGF, you gain access to a powerful summary function whose derivatives recover the mean, second moment, and variance. In short, learning MGFs is not just about one formula. It is about building a bridge from a probability table to deeper analytical tools in statistics and probability.