Scribd
Upload
6 views2 pages

Probability Distributions Memory Guide

This guide offers mnemonic patterns, formulas, and a memory matrix to aid in recalling probability distributions for exams. It categorizes distributions into discrete and continuous types, provides mean and variance formulas, and outlines moment generating functions for each distribution. Additionally, it includes mnemonic sentences to help remember the classifications of the distributions.

Uploaded by

targetspec342
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
6 views2 pages

Probability Distributions Memory Guide

This guide offers mnemonic patterns, formulas, and a memory matrix to aid in recalling probability distributions for exams. It categorizes distributions into discrete and continuous types, provides mean and variance formulas, and outlines moment generating functions for each distribution. Additionally, it includes mnemonic sentences to help remember the classifications of the distributions.

Uploaded by

targetspec342
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Engineering Statistics – Probability Distributions Memory Guide

This guide provides mnemonic patterns, formulas, and a memory matrix to help recall
probability distribution results quickly in exams.

Step 1: Classification
• Discrete (counting): Bernoulli, Binomial, Geometric, Negative Binomial, Poisson
• Continuous (measuring): Uniform, Exponential, Normal
Mnemonic: Discrete = counts, Continuous = measures.

Step 2: Mean–Variance Pattern


Distribution Mean (E[X]) Variance (Var[X]) Mnemonic

Bernoulli(p) E[X] = p Var[X] = p(1–p) One trial

Binomial(n,p) E[X] = np Var[X] = np(1–p) n Bernoullis

Geometric(p) E[X] = 1/p Var[X] = (1–p)/p² Reciprocal of p

Neg. Binomial(r,p) E[X] = r/p Var[X] = r(1–p)/p² r × Geometric

Poisson(λ) E[X] = λ Var[X] = λ Balanced: mean=var

Uniform(a,b) E[X] = (a+b)/2 Var[X] = (b–a)²/12 Midpoint &


range²/12

Exponential(λ) E[X] = 1/λ Var[X] = 1/λ² Reciprocal &


squared

Normal(μ,σ²) E[X] = μ Var[X] = σ² Bell curve

Step 3: Moment Generating Function (MGF) Patterns

• Bernoulli(p): M_X(t) = 1 – p + pe^t


• Binomial(n,p): M_X(t) = (1 – p + pe^t)^n
• Geometric(p): M_X(t) = (pe^t) / (1 – (1 – p)e^t)
• Neg. Binomial(r,p): M_X(t) = [(pe^t) / (1 – (1 – p)e^t)]^r
• Poisson(λ): M_X(t) = exp(λ(e^t – 1))
• Uniform(a,b): M_X(t) = (e^(tb) – e^(ta)) / (t(b – a))
• Exponential(λ): M_X(t) = λ / (λ – t), t < λ
• Normal(μ,σ²): M_X(t) = exp(μt + ½σ²t²)
Step 4: Memory Matrix

DISCRETE FAMILY
• Bernoulli → (p, p(1–p), 1–p+pe^t)
• Binomial → (np, np(1–p), (Bernoulli MGF)^n)
• Geometric → (1/p, (1–p)/p², fraction form)
• Neg. Binomial → (r/p, r(1–p)/p², (Geometric MGF)^r)
• Poisson → (λ, λ, exp[λ(e^t–1)])

CONTINUOUS FAMILY
• Uniform(a,b) → ((a+b)/2, (b–a)²/12, (e^(tb)–e^(ta))/(t(b–a)))
• Exponential(λ) → (1/λ, 1/λ², λ/(λ–t))
• Normal(μ,σ²) → (μ, σ², exp(μt+½σ²t²))

Step 5: Mnemonic Sentences

• Discrete family (B–B–G–N–P): "Baby Boys Go Near People"


• Continuous family (U–E–N): "U Eat Noodles"

You might also like