MGFs of Common Distributions
What you'll learn: You'll memorize and understand how to derive the moment generating functions for all the standard probability distributions you've studied.
Why MGFs Matter for Each Distribution
You've learned that moment generating functions (MGFs) uniquely identify distributions and make finding moments trivial. Now it's time to build your "lookup table" of MGFs for the distributions you've encountered—from Bernoulli to Normal to Gamma.
Common Discrete Distributions
Bernoulli(p): For a single success/failure trial, the MGF is:
Binomial(n, p): Since it's the sum of n independent Bernoulli trials, the MGF is the product of n identical Bernoulli MGFs:
Geometric(p): Counting trials until first success:
Poisson(λ): The classic rare-event distribution:
Common Continuous Distributions
Uniform(a, b): The "flat" distribution:
Exponential(λ): Memoryless waiting time:
Normal(μ, σ²): The bell curve:
Gamma(α, β): Generalizes exponential:
How to Use These
Memorize the patterns: discrete distributions often have polynomial or rational forms; continuous ones often have exponential structures. When you see an MGF, you can identify the distribution instantly!
Key Takeaway: Each standard distribution has a characteristic MGF formula that encodes all its moments and uniquely identifies it—learn these formulas to quickly recognize distributions and compute moments.