Achievable logoAchievable logo
FE Mechanical
Sign in
Sign up
Purchase
Textbook
Practice exams
Support
How it works
Exam catalog
Mountain with a flag at the peak
Textbook
1. Mathematics
2. Probability & statistics
2.1 Sets & counting
2.2 Laws of probability
2.3 Probability distributions
2.4 Expected value & dispersion
2.5 Common probability distributions
2.6 Hypothesis testing, Z-test & t-test
3. Ethics & professional practice
4. Engineering economics
5. Electricity & magnetism
6. Statics
7. sandbox
Example
Achievable logoAchievable logo
2.5 Common probability distributions
FE Mechanical
2. Probability & statistics
Our FE Mechanical course is currently in development and is a work-in-progress.

Common probability distributions

7 min read
Font
Discuss
Share
Feedback

Many probability distributions capture various real-world patterns, from equally likely outcomes to natural variation around an average or the frequency of rare events. Understanding these distributions helps analysts choose appropriate models, interpret data correctly, and make informed predictions across fields such as science, economics, engineering, and social research.

The most common probability distributions are described below, where functions of the form pX​(k) represents the probability mass function (PMF) of a discrete random variable X, and functions of the form fX​(x) represents the probability density function (PDF) of a continuous random variable X. Some are described in terms of a collection of independent and identically distributed (IID) random variables, where each random variable has the same probability distribution as the others and all are mutually independent.

  • Uniform (discrete)
  • Uniform (continuous)
  • Bernoulli
  • Binomial
  • Poisson
  • Geometric
  • Exponential
  • Normal (Gaussian, Z)
  • Pascal
  • Erlang
  • Hypergeometric

Uniform (discrete)

The uniform (discrete) distribution models a scenario where the integers from a to b are all equally likely to occur.

The PMF is:

pX​(k)​=​b−a+11​,for k=a,a+1,…,b​

The expected value is:

2a+b​

The variance is:

12(b−a)(b−a+2)​

Uniform (continuous)

The uniform (continuous) distribution models a scenario where the real numbers from a to b are all equally likely to occur.

The PDF is:

fX​(x)​=​b−a1​,fora≤x≤b​​

The expected value is:

2a+b​

The variance is:

12(b−a)2​

Bernoulli

The Bernoulli distribution models the number of successes k (either 0 or 1) coming up in a single flip of a biased coin, where p is the probability of the coin flipping a “success” (e.g., heads).

The PMF is:

px(k)=⎩⎨⎧​p,1−p,​if k=1if k=0​

The expected value is:

p

The variance is:

p(1−p)

Binomial

The binomial distribution models the number of successes k in n flips of a biased coin, where p is the probability of the coin flipping a “success” (e.g., heads). The binomial distribution is the sum of n IID Bernoulli RVs, and may be considered the “converse” of the Pascal distribution (see below) in the sense that the binomial distribution fixes the number of flips and models the number of successes, whereas the Pascal distribution fixes the number of successes and models the number of flips.

The PMF is:

pX​(k)​=​(kn​)pk(1−p)n−k,fork=0,1,...,n​​

The expected value is:

np

The variance is:

np(1−p)

Poisson

The Poisson distribution models the number of events k in a unit time interval of a Poisson process. The Poisson distribution approximates the binomial when n is large and p is small, so λ=np. The Poisson distribution may be considered the “converse” of the Erlang distribution (see below) in the sense that the Poisson distribution fixes the length of the time interval and models the number of events, whereas the Erlang distribution fixes the number of events and models the length of the time interval.

The PMF is:

pX​(k)​=​e−λk!λk​,fork=0,1,...​​

The expected value is:

λ

The variance is:

λ

Geometric

The geometric distribution models the number of tries k until the first success in a sequence of independent flips of a biased coin, where p is the probability of the coin flipping a “success” (e.g., heads). The geometric distribution is equivalent to a Pascal distribution (see below) for just a single success.

The PMF is:

pX​(k)​=​(1−p)k−1p,fork=1,2,...​​

The expected value is:

p1​

The variance is:

p21−p​

Exponential

The exponential distribution models the wait time x until the first event in a Poisson process. The exponential distribution is equivalent to an Erlang distribution for just a single success, and it approximates the geometric distribution when p is very small, so p=1−e−λ, λ=−ln(1−p).

The PDF is:

fX​(x)​=​λe−λx,forx≥0​​

The expected value is:

λ1​

The variance is:

λ21​

Normal (Gaussian, Z)

The normal (Gaussian, Z) distribution, the so-called “bell curve,” models many real-life scenarios and is one of the most important probability distributions. The mean of nearly every arbitrary IID random variable approaches the normal distribution due to the central limit theorem.

The PDF is:

fX​(x)​=​σ2π​1​e−(x−μ)2/2σ2,forallrealx​​

The expected value is:

μ

The variance is:

σ2

Pascal

The Pascal (or “negative binomial”) distribution models the number of tries t until the kth success in a sequence of independent flips of a biased coin, where p is the probability of the coin flipping a “success” (e.g., heads). Yk​ is the sum of k IID geometric RVs. The Pascal distribution may be considered the “converse” of the binomial distribution in the sense that the binomial distribution fixes the number of flips and models the number of successes, whereas the Pascal distribution fixes the number of successes and models the number of flips.

The PMF is:

pYk​​(t)​=​(k−1t−1​)pk(1−p)t−k,fort=k,k+1,...​​

The expected value is:

pk​

The variance is:

p2k(1−p)​

Erlang

The Erlang distribution models the wait time y until the kth success in a Poisson process. Yk​ is the sum of k IID exponential random variables. The Erlang distribution approximates the Pascal distribution when p is very small, and may be considered the “converse” of the Poisson distribution in the sense that the Poisson distribution fixes the length of the time interval and models the number of events, whereas the Erlang distribution fixes the number of events and models the length of the time interval.

The PDF is:

fYk​​(y)​=​(k−1)!λkyk−1e−λy​,fory≥0​​

The expected value is:

λk​

The variance is:

λ2k​

Hypergeometric

The hypergeometric distribution models the scenario of an urn that contains N marbles, of which K are green and N−K are red. A total of n marbles are drawn without replacement. X is the random variable whose outcome is k, the number of green marbles drawn. The hypergeometric distribution reduces to the binomial distribution when n≪K and n≪N, where p=K/N.

The PMF is:

pX​(k)​=​(nN​)(kK​)(n−kN−K​)​​​

The expected value is:

nNK​

The variance is:

nNK​NN−K​N−1N−n​

Uniform (discrete)

  • All integers from a to b equally likely
  • PMF: pX​(k)=b−a+11​ for k=a,...,b
  • Expected value: 2a+b​; Variance: 12(b−a)(b−a+2)​

Uniform (continuous)

  • All real numbers from a to b equally likely
  • PDF: fX​(x)=b−a1​ for a≤x≤b
  • Expected value: 2a+b​; Variance: 12(b−a)2​

Bernoulli

  • One trial, two outcomes: success (1) with probability p, failure (0) with 1−p
  • PMF: p if k=1, 1−p if k=0
  • Expected value: p; Variance: p(1−p)

Binomial

  • Number of successes in n IID Bernoulli trials (probability p)
  • PMF: pX​(k)=(kn​)pk(1−p)n−k for k=0,...,n
  • Expected value: np; Variance: np(1−p)

Poisson

  • Number of events in unit time, rate λ
  • PMF: pX​(k)=e−λk!λk​ for k=0,1,...
  • Expected value: λ; Variance: λ

Geometric

  • Number of trials until first success, probability p
  • PMF: pX​(k)=(1−p)k−1p for k=1,2,...
  • Expected value: p1​; Variance: p21−p​

Exponential

  • Wait time until first event in Poisson process, rate λ
  • PDF: fX​(x)=λe−λx for x≥0
  • Expected value: λ1​; Variance: λ21​

Normal (Gaussian, Z)

  • Bell curve; models many natural phenomena
  • PDF: fX​(x)=σ2π​1​e−(x−μ)2/2σ2
  • Expected value: μ; Variance: σ2

Pascal (Negative Binomial)

  • Number of trials until kth success, probability p
  • PMF: pYk​​(t)=(k−1t−1​)pk(1−p)t−k for t=k,k+1,...
  • Expected value: pk​; Variance: p2k(1−p)​

Erlang

  • Wait time until kth event in Poisson process, rate λ
  • PDF: fYk​​(y)=(k−1)!λkyk−1e−λy​ for y≥0
  • Expected value: λk​; Variance: λ2k​

Hypergeometric

  • Number of successes in n draws without replacement from N items (K successes)
  • PMF: pX​(k)=(nN​)(kK​)(n−kN−K​)​
  • Expected value: nNK​; Variance: nNK​NN−K​N−1N−n​
Previous
Next  | 2.6 Hypothesis testing, Z-test & t-test
All rights reserved ©2016 - 2026 Achievable, Inc.

Common probability distributions

Many probability distributions capture various real-world patterns, from equally likely outcomes to natural variation around an average or the frequency of rare events. Understanding these distributions helps analysts choose appropriate models, interpret data correctly, and make informed predictions across fields such as science, economics, engineering, and social research.

The most common probability distributions are described below, where functions of the form pX​(k) represents the probability mass function (PMF) of a discrete random variable X, and functions of the form fX​(x) represents the probability density function (PDF) of a continuous random variable X. Some are described in terms of a collection of independent and identically distributed (IID) random variables, where each random variable has the same probability distribution as the others and all are mutually independent.

  • Uniform (discrete)
  • Uniform (continuous)
  • Bernoulli
  • Binomial
  • Poisson
  • Geometric
  • Exponential
  • Normal (Gaussian, Z)
  • Pascal
  • Erlang
  • Hypergeometric

Uniform (discrete)

The uniform (discrete) distribution models a scenario where the integers from a to b are all equally likely to occur.

The PMF is:

pX​(k)​=​b−a+11​,for k=a,a+1,…,b​

The expected value is:

2a+b​

The variance is:

12(b−a)(b−a+2)​

Uniform (continuous)

The uniform (continuous) distribution models a scenario where the real numbers from a to b are all equally likely to occur.

The PDF is:

fX​(x)​=​b−a1​,fora≤x≤b​​

The expected value is:

2a+b​

The variance is:

12(b−a)2​

Bernoulli

The Bernoulli distribution models the number of successes k (either 0 or 1) coming up in a single flip of a biased coin, where p is the probability of the coin flipping a “success” (e.g., heads).

The PMF is:

px(k)=⎩⎨⎧​p,1−p,​if k=1if k=0​

The expected value is:

p

The variance is:

p(1−p)

Binomial

The binomial distribution models the number of successes k in n flips of a biased coin, where p is the probability of the coin flipping a “success” (e.g., heads). The binomial distribution is the sum of n IID Bernoulli RVs, and may be considered the “converse” of the Pascal distribution (see below) in the sense that the binomial distribution fixes the number of flips and models the number of successes, whereas the Pascal distribution fixes the number of successes and models the number of flips.

The PMF is:

pX​(k)​=​(kn​)pk(1−p)n−k,fork=0,1,...,n​​

The expected value is:

np

The variance is:

np(1−p)

Poisson

The Poisson distribution models the number of events k in a unit time interval of a Poisson process. The Poisson distribution approximates the binomial when n is large and p is small, so λ=np. The Poisson distribution may be considered the “converse” of the Erlang distribution (see below) in the sense that the Poisson distribution fixes the length of the time interval and models the number of events, whereas the Erlang distribution fixes the number of events and models the length of the time interval.

The PMF is:

pX​(k)​=​e−λk!λk​,fork=0,1,...​​

The expected value is:

λ

The variance is:

λ

Geometric

The geometric distribution models the number of tries k until the first success in a sequence of independent flips of a biased coin, where p is the probability of the coin flipping a “success” (e.g., heads). The geometric distribution is equivalent to a Pascal distribution (see below) for just a single success.

The PMF is:

pX​(k)​=​(1−p)k−1p,fork=1,2,...​​

The expected value is:

p1​

The variance is:

p21−p​

Exponential

The exponential distribution models the wait time x until the first event in a Poisson process. The exponential distribution is equivalent to an Erlang distribution for just a single success, and it approximates the geometric distribution when p is very small, so p=1−e−λ, λ=−ln(1−p).

The PDF is:

fX​(x)​=​λe−λx,forx≥0​​

The expected value is:

λ1​

The variance is:

λ21​

Normal (Gaussian, Z)

The normal (Gaussian, Z) distribution, the so-called “bell curve,” models many real-life scenarios and is one of the most important probability distributions. The mean of nearly every arbitrary IID random variable approaches the normal distribution due to the central limit theorem.

The PDF is:

fX​(x)​=​σ2π​1​e−(x−μ)2/2σ2,forallrealx​​

The expected value is:

μ

The variance is:

σ2

Pascal

The Pascal (or “negative binomial”) distribution models the number of tries t until the kth success in a sequence of independent flips of a biased coin, where p is the probability of the coin flipping a “success” (e.g., heads). Yk​ is the sum of k IID geometric RVs. The Pascal distribution may be considered the “converse” of the binomial distribution in the sense that the binomial distribution fixes the number of flips and models the number of successes, whereas the Pascal distribution fixes the number of successes and models the number of flips.

The PMF is:

pYk​​(t)​=​(k−1t−1​)pk(1−p)t−k,fort=k,k+1,...​​

The expected value is:

pk​

The variance is:

p2k(1−p)​

Erlang

The Erlang distribution models the wait time y until the kth success in a Poisson process. Yk​ is the sum of k IID exponential random variables. The Erlang distribution approximates the Pascal distribution when p is very small, and may be considered the “converse” of the Poisson distribution in the sense that the Poisson distribution fixes the length of the time interval and models the number of events, whereas the Erlang distribution fixes the number of events and models the length of the time interval.

The PDF is:

fYk​​(y)​=​(k−1)!λkyk−1e−λy​,fory≥0​​

The expected value is:

λk​

The variance is:

λ2k​

Hypergeometric

The hypergeometric distribution models the scenario of an urn that contains N marbles, of which K are green and N−K are red. A total of n marbles are drawn without replacement. X is the random variable whose outcome is k, the number of green marbles drawn. The hypergeometric distribution reduces to the binomial distribution when n≪K and n≪N, where p=K/N.

The PMF is:

pX​(k)​=​(nN​)(kK​)(n−kN−K​)​​​

The expected value is:

nNK​

The variance is:

nNK​NN−K​N−1N−n​

Key points

Uniform (discrete)

  • All integers from a to b equally likely
  • PMF: pX​(k)=b−a+11​ for k=a,...,b
  • Expected value: 2a+b​; Variance: 12(b−a)(b−a+2)​

Uniform (continuous)

  • All real numbers from a to b equally likely
  • PDF: fX​(x)=b−a1​ for a≤x≤b
  • Expected value: 2a+b​; Variance: 12(b−a)2​

Bernoulli

  • One trial, two outcomes: success (1) with probability p, failure (0) with 1−p
  • PMF: p if k=1, 1−p if k=0
  • Expected value: p; Variance: p(1−p)

Binomial

  • Number of successes in n IID Bernoulli trials (probability p)
  • PMF: pX​(k)=(kn​)pk(1−p)n−k for k=0,...,n
  • Expected value: np; Variance: np(1−p)

Poisson

  • Number of events in unit time, rate λ
  • PMF: pX​(k)=e−λk!λk​ for k=0,1,...
  • Expected value: λ; Variance: λ

Geometric

  • Number of trials until first success, probability p
  • PMF: pX​(k)=(1−p)k−1p for k=1,2,...
  • Expected value: p1​; Variance: p21−p​

Exponential

  • Wait time until first event in Poisson process, rate λ
  • PDF: fX​(x)=λe−λx for x≥0
  • Expected value: λ1​; Variance: λ21​

Normal (Gaussian, Z)

  • Bell curve; models many natural phenomena
  • PDF: fX​(x)=σ2π​1​e−(x−μ)2/2σ2
  • Expected value: μ; Variance: σ2

Pascal (Negative Binomial)

  • Number of trials until kth success, probability p
  • PMF: pYk​​(t)=(k−1t−1​)pk(1−p)t−k for t=k,k+1,...
  • Expected value: pk​; Variance: p2k(1−p)​

Erlang

  • Wait time until kth event in Poisson process, rate λ
  • PDF: fYk​​(y)=(k−1)!λkyk−1e−λy​ for y≥0
  • Expected value: λk​; Variance: λ2k​

Hypergeometric

  • Number of successes in n draws without replacement from N items (K successes)
  • PMF: pX​(k)=(nN​)(kK​)(n−kN−K​)​
  • Expected value: nNK​; Variance: nNK​NN−K​N−1N−n​

More from Probability & statistics

  • Sets & counting
  • Laws of probability
  • Probability distributions
  • Expected value & dispersion
  • Hypothesis testing, Z-test & t-test