Study guide
6.2 Discrete Probability Distributions
FE Industrial and Systems Study Guide Exam
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: Exam Overview, CBT Strategy & Handbook Navigation
1.1 FE Industrial Exam Structure, CBT Logistics, and Pacing 1.2 Using the NCEES FE Reference Handbook and Approved Calculators
2 Chapter 2: Mathematics for Industrial Engineers
2.1 Analytic Geometry, Coordinate Systems, and Trigonometry 2.2 Calculus: Differential, Integral, and Series Approximations 2.3 Linear Algebra: Matrix Operations, Systems of Equations, and Vectors
3 Chapter 3: Engineering Sciences Core
3.1 Thermodynamics Fundamentals and Fluid Flow Principles 3.2 Statics, Dynamics, and Mechanics of Materials Core 3.3 Electrical Circuits, DC/AC Analysis, and Power in Industrial Systems
4 Chapter 4: Ethics and Professional Practice
4.1 NCEES Model Rules of Professional Conduct and Technical Society Ethics 4.2 Engineering Licensure, Public Welfare, and Professional Liability 4.3 Engineering Contracts, Intellectual Property, and Conflicts of Interest
5 Chapter 5: Engineering Economics
5.1 Time Value of Money, Discount Factors, and Equivalence 5.2 Evaluating Alternatives: Present Worth, Equivalent Annual Cost, and IRR 5.3 Incremental Rate of Return, Replacement Analysis, and Break-Even 5.4 Depreciation Methods, MACRS, Income Taxes, and Inflation
6 Chapter 6: Probability Foundations & Distributions
6.1 Basic Probability Concepts, Conditional Probability, and Bayes' Theorem 6.2 Discrete Probability Distributions 6.3 Continuous Probability Distributions
7 Chapter 7: Statistical Inference, Regression & Design of Experiments
7.1 Sampling Distributions, Central Limit Theorem, and Confidence Intervals 7.2 Hypothesis Testing: Means, Proportions, and Variances 7.3 Linear Regression, Correlation Analysis, and Design of Experiments (ANOVA)
8 Chapter 8: Data, Logic, Modeling & Linear Programming
8.1 Optimization Modeling: Decision Variables, Objectives, and Constraints 8.2 Linear Programming: Graphical Solutions and Simplex Fundamentals 8.3 Duality, Sensitivity Analysis, and Integer Linear Programming 8.4 Data, Logic Development, and Analytics
9 Chapter 9: Stochastic Models & Simulation
9.1 Queuing Theory: Little's Law, M/M/1, and Multi-Server Systems 9.2 Discrete-Time Markov Chains: Transition Matrices and Steady-State Probabilities 9.3 Discrete-Event Simulation Principles and Monte Carlo Modeling
10 Chapter 10: Engineering Management, Project Planning & Performance Measurement
10.1 Organizational Structure, Leadership, and Worker Motivation Theories 10.2 Project Management: WBS, Critical Path Method (CPM), PERT, and Crashing 10.3 Earned Value Management (EVM), Decision Trees, and Risk Preference 10.4 Performance Measurement: Productivity, KPIs, Wage Systems, and the Balanced Scorecard
11 Chapter 11: Manufacturing & Production Systems
11.1 Manufacturing Processes, Material Processing, and Tolerancing 11.2 Assembly Line Balancing, Takt Time, Cycle Time, and Throughput 11.3 Sustainable Manufacturing, Waste Minimization, and Life-Cycle Assessment
12 Chapter 12: Production Planning, Inventory Control & Sequencing
12.1 Demand Forecasting Methods and Forecast Error Tracking 12.2 Aggregate Planning, Master Production Scheduling (MPS), and MRP 12.3 Deterministic Inventory Models: EOQ, EPQ, and Safety Stock 12.4 Job Sequencing, Dispatching Rules, and Flow Shop Scheduling
13 Chapter 13: Lean Systems & Theory of Constraints
13.1 Lean Foundations: Value Stream Mapping, Seven Wastes, and 5S 13.2 Pull Systems, Kanban, Just-In-Time (JIT), and SMED Setup Reduction 13.3 Theory of Constraints: Bottleneck Identification and Drum-Buffer-Rope
14 Chapter 14: Facilities Planning & Material Handling
14.1 Facility Location Analysis: Qualitative Factor Rating and Centroid Method 14.2 Facility Layout Design and Flow Analysis 14.3 Material Handling Equipment, Warehousing, and AS/RS
15 Chapter 15: Supply Chain Design & Logistics
15.1 Supply Chain Network Architecture and Transportation Modes 15.2 Distribution Strategies, Cross-Docking, and Vehicle Routing 15.3 The Bullwhip Effect, Risk Pooling, and Supply Chain Coordination
16 Chapter 16: Human Factors & Cognitive Ergonomics
16.1 Cognitive Engineering, Human-Machine Interface, Displays, and Controls 16.2 Anthropometric Principles, Percentile Design, and Biomechanical Posture 16.3 Environmental Ergonomics: Industrial Noise, Lighting, and Heat Stress
17 Chapter 17: Physical Ergonomics & Workplace Safety
17.1 Physical Ergonomics: The NIOSH Manual Lifting Equation 17.2 Cumulative Trauma Disorders and Postural Assessment 17.3 Workplace Safety: OSHA Standards, Hazard Analysis, and Control Hierarchy
18 Chapter 18: Work Design & Measurement
18.1 Methods Engineering, Process Charting, and Principles of Motion Economy 18.2 Direct Stopwatch Time Study: Observed Time, Performance Rating, and Allowances 18.3 Predetermined Time Systems, Work Sampling, and Learning Curves
19 Chapter 19: Quality Management, Six Sigma & Analytical Tools
19.1 Quality Philosophies, Total Quality Management, and Cost of Quality 19.2 Six Sigma DMAIC Methodology and Quality Function Deployment 19.3 The Seven Basic Quality Tools, Root Cause Analysis, and Taguchi Loss Function
20 Chapter 20: Statistical Process Control
20.1 Statistical Process Control Principles, Variation, and Run Rules 20.2 Variable Control Charts: X-bar & R, X-bar & S, and Individual-Moving Range 20.3 Attribute Control Charts: Defectives (p, np) and Defects (c, u)
21 Chapter 21: Process Capability & Acceptance Sampling
21.1 Process Capability Indices and Defect Levels 21.2 Acceptance Sampling Concepts and Operating Characteristic Curves 21.3 Sampling Risks, AQL, LTPD, and Standard Sampling Plans
22 Chapter 22: Systems Engineering & Life-Cycle Management
22.1 The Systems Engineering V-Model, Stakeholder Requirements, and Functional Architecture 22.2 Configuration Management, Interface Control, and Verification & Validation 22.3 Life-Cycle Costing, Maintainability, and System Availability
23 Chapter 23: Reliability Engineering & Risk Analysis
23.1 Reliability Mathematics, Hazard Rates, and the Bathtub Curve 23.2 System Reliability Configurations: Series, Parallel, and k-out-of-n Systems 23.3 Failure Modes and Effects Analysis and Fault Tree Analysis
6.2 Discrete Probability Distributions
Key Takeaways Explain This Topic AI
A discrete probability mass function (PMF) satisfies p(x) ≥ 0 and Σ p(x) = 1; the cumulative distribution function (CDF) F(x) = P(X ≤ x) is a non-decreasing right-continuous step function where P(a < X ≤ b) = F(b) - F(a).
The Binomial distribution models k successes in n independent Bernoulli trials with constant probability p, having mean μ = np and variance σ² = np(1-p).
The Poisson distribution governs counts of rare events occurring at a constant average rate λ over a continuous interval, uniquely characterized by equal mean and variance (E(X) = Var(X) = λ), and accurately approximates the binomial distribution when n ≥ 20 and p ≤ 0.05.
The Hypergeometric distribution models sampling without replacement from a finite population of size N containing K defectives, introducing the finite population correction factor (N - n)/(N - 1) to its variance.
The Geometric distribution models the number of trials until the first success occurs with mean μ = 1/p and exhibits the memoryless property, while the Negative Binomial distribution generalizes this to the number of trials required to achieve r successes.
Last updated: September 2026
Discrete probability distributions model countable random phenomena where outcomes take on isolated integer values. In industrial and systems engineering, discrete distributions form the backbone of statistical quality control, acceptance sampling, inventory stockout evaluations, and service queue analysis. The NCEES FE Reference Handbook provides explicit formulas for the probability mass function (PMF), mean, and variance of several key distributions. Recognizing the physical conditions that dictate which distribution to apply is one of the most critical problem-solving skills on the FE exam.
- 1. Discrete Random Variables: PMF, CDF, Expectation, and Variance
- Probability Mass Function (PMF)
A discrete random variable X X X assumes a countable set of distinct values { x 1 , x 2 , … } \{x_1, x_2, \dots\} { x 1 , x 2 , … } . Its probability mass function , denoted p ( x ) = P ( X = x ) p(x) = P(X = x) p ( x ) = P ( X = x ) , must satisfy two foundational criteria:
- p ( x i ) ≥ 0 p(x_i) \ge 0 p ( x i ) ≥ 0 for all x i x_i x i
- ∑ i p ( x i ) = 1 \sum_{i} p(x_i) = 1 ∑ i p ( x i ) = 1
- Cumulative Distribution Function (CDF)
The cumulative distribution function , denoted F ( x ) F(x) F ( x ) , gives the probability that the random variable X X X takes on a value less than or equal to a specified threshold x x x : F ( x ) = P ( X ≤ x ) = ∑ t ≤ x p ( t ) F(x) = P(X \le x) = \sum_{t \le x} p(t) F ( x ) = P ( X ≤ x ) = t ≤ x ∑ p ( t )
Properties of the discrete CDF include:
F ( x ) F(x) F ( x ) is a step function that is non-decreasing and continuous from the right (right-continuous).
lim x → − ∞ F ( x ) = 0 \lim_{x \to -\infty} F(x) = 0 lim x → − ∞ F ( x ) = 0 and lim x → ∞ F ( x ) = 1 \lim_{x \to \infty} F(x) = 1 lim x → ∞ F ( x ) = 1 .
The probability of an exact outcome is the jump size at that value: P ( X = x ) = F ( x ) − F ( x − ) P(X = x) = F(x) - F(x^-) P ( X = x ) = F ( x ) − F ( x − ) .
For any interval ( a , b ] (a, b] ( a , b ] where a < b a < b a < b : P ( a < X ≤ b ) = F ( b ) − F ( a ) P(a < X \le b) = F(b) - F(a) P ( a < X ≤ b ) = F ( b ) − F ( a )
Expected Value and Linear Properties
The expected value (or population mean μ \mu μ ) is the probability-weighted average of all possible values: E ( X ) = μ = ∑ i x i ⋅ p ( x i ) E(X) = \mu = \sum_{i} x_i \cdot p(x_i) E ( X ) = μ = i ∑ x i ⋅ p ( x i )
Expected value is a strictly linear operator . For any constants a a a and b b b , and any two random variables X X X and Y Y Y (whether independent or dependent): E ( a X + b ) = a E ( X ) + b E(aX + b) = a E(X) + b E ( a X + b ) = a E ( X ) + b E ( X + Y ) = E ( X ) + E ( Y ) E(X + Y) = E(X) + E(Y) E ( X + Y ) = E ( X ) + E ( Y )
Variance and Standard Deviation
The variance σ 2 \sigma^2 σ 2 or Var ( X ) \text{Var}(X) Var ( X ) measures the expected squared deviation about the mean: Var ( X ) = σ 2 = E [ ( X − μ ) 2 ] = ∑ i ( x i − μ ) 2 p ( x i ) \text{Var}(X) = \sigma^2 = E[(X - \mu)^2] = \sum_{i} (x_i - \mu)^2 p(x_i) Var ( X ) = σ 2 = E [( X − μ ) 2 ] = i ∑ ( x i − μ ) 2 p ( x i )
Using the computational shortcut formula: Var ( X ) = E ( X 2 ) − [ E ( X ) ] 2 = ( ∑ i x i 2 p ( x i ) ) − μ 2 \text{Var}(X) = E(X^2) - [E(X)]^2 = \left( \sum_{i} x_i^2 p(x_i) \right) - \mu^2 Var ( X ) = E ( X 2 ) − [ E ( X ) ] 2 = ( i ∑ x i 2 p ( x i ) ) − μ 2
Properties of variance:
Var ( a X + b ) = a 2 Var ( X ) \text{Var}(aX + b) = a^2 \text{Var}(X) Var ( a X + b ) = a 2 Var ( X ) (adding a constant shifts location without altering spread; multiplying scales by a 2 a^2 a 2 ).
Standard deviation is the positive square root: σ = Var ( X ) \sigma = \sqrt{\text{Var}(X)} σ = Var ( X ) .
For independent random variables X X X and Y Y Y : Var ( X ± Y ) = Var ( X ) + Var ( Y ) \text{Var}(X \pm Y) = \text{Var}(X) + \text{Var}(Y) Var ( X ± Y ) = Var ( X ) + Var ( Y ) (Note: Variances always add; they never subtract!)
- 2. The Binomial Distribution in Manufacturing Quality Control
- Conditions for a Binomial Experiment (The BINS Framework)
A random variable X X X follows a Binomial distribution , denoted X ∼ Bin ( n , p ) X \sim \text{Bin}(n, p) X ∼ Bin ( n , p ) , if and only if the process satisfies four conditions:
Binary Outcomes : Each trial results in one of exactly two mutually exclusive outcomes: Success ( S S S ) or Failure ( F F F ). In quality control, "success" often denotes finding a defective unit.
Independent Trials : The outcome of any individual trial does not influence any other trial.
Number of Trials ( n n n ) is Fixed : The experiment consists of a predetermined number of trials n n n .
Same Probability ( p p p ) : The probability of success p p p remains strictly constant across all trials (sampling with replacement or sampling from an infinite/very large lot).
Probability Mass Function, Mean, and Variance
The probability of obtaining exactly k k k successes in n n n independent trials is: P ( X = k ) = ( n k ) p k ( 1 − p ) n − k = n ! k ! ( n − k ) ! p k ( 1 − p ) n − k , k = 0 , 1 , 2 , … , n P(X = k) = \binom{n}{k} p^k (1 - p)^{n - k} = \frac{n!}{k! \, (n - k)!} p^k (1 - p)^{n - k}, \quad k = 0, 1, 2, \dots, n P ( X = k ) = ( k n ) p k ( 1 − p ) n − k = k ! ( n − k )! n ! p k ( 1 − p ) n − k , k = 0 , 1 , 2 , … , n
Mean : E ( X ) = μ = n p E(X) = \mu = n p E ( X ) = μ = n p
Variance : Var ( X ) = σ 2 = n p ( 1 − p ) = n p q \text{Var}(X) = \sigma^2 = n p (1 - p) = n p q Var ( X ) = σ 2 = n p ( 1 − p ) = n pq (where q = 1 − p q = 1 - p q = 1 − p )
Standard Deviation : σ = n p ( 1 − p ) \sigma = \sqrt{n p (1 - p)} σ = n p ( 1 − p ) Binomial Distribution Conditions (BINS):
- [B]inary outcomes ──────> Conforming vs. Non-conforming
- [I]ndependent trials ───> One part's status does not affect the next
- [N]umber of trials ─────> n is fixed in advance
- [S]ame probability ─────> p is constant across all trials
- 3. The Poisson Distribution and Poisson Process Modeling
- Conditions for a Poisson Process
The Poisson distribution models the number of occurrences of an event over a specified continuous interval (time, area, volume, or length). A Poisson process assumes:
Events occur at a constant average rate λ \lambda λ per unit interval.
Occurrences in non-overlapping intervals are statistically independent.
The probability of two or more events occurring at the exact same instantaneous point in time/space is negligible (events occur individually).
Probability Mass Function, Mean, and Variance
If X X X represents the count of events in an interval where the expected number of occurrences is λ \lambda λ : P ( X = k ) = λ k e − λ k ! , k = 0 , 1 , 2 , 3 , … P(X = k) = \frac{\lambda^k e^{-\lambda}}{k!}, \quad k = 0, 1, 2, 3, \dots P ( X = k ) = k ! λ k e − λ , k = 0 , 1 , 2 , 3 , …
- Mean : E ( X ) = μ = λ E(X) = \mu = \lambda E ( X ) = μ = λ
- Variance : Var ( X ) = σ 2 = λ \text{Var}(X) = \sigma^2 = \lambda Var ( X ) = σ 2 = λ
- Standard Deviation : σ = λ \sigma = \sqrt{\lambda} σ = λ
Defining Characteristic : In a Poisson distribution, the variance is always equal to the mean ( σ 2 = μ = λ \sigma^2 = \mu = \lambda σ 2 = μ = λ ). If empirical defect data shows a variance significantly larger than the mean, the process exhibits overdispersion and violates Poisson assumptions.
Scaling the Rate Parameter
If occurrences occur at rate α \alpha α per unit interval and the evaluated interval length is t t t , then: λ = α ⋅ t \lambda = \alpha \cdot t λ = α ⋅ t
Example : If customer orders arrive at an automated distribution center at an average rate of α = 12 orders/hour \alpha = 12\text{ orders/hour} α = 12 orders/hour , then over a 20 -minute 20\text{-minute} 20 -minute window ( t = 1 / 3 hour t = 1/3\text{ hour} t = 1/3 hour ), the parameter is λ = 12 × ( 1 / 3 ) = 4.0 orders \lambda = 12 \times (1/3) = 4.0\text{ orders} λ = 12 × ( 1/3 ) = 4.0 orders .
Poisson Approximation to the Binomial
When the number of trials n n n in a binomial experiment is large and the probability of success p p p is small (modeling "rare events"), the binomial distribution is closely approximated by a Poisson distribution with: λ = n p \lambda = n p λ = n p
Rule of Thumb for NCEES FE Exam : The approximation is acceptable when n ≥ 20 n \ge 20 n ≥ 20 and p ≤ 0.05 p \le 0.05 p ≤ 0.05 , and exceptionally accurate when n ≥ 100 n \ge 100 n ≥ 100 and n p ≤ 10 n p \le 10 n p ≤ 10 . This saves candidates from computing large factorials like ( 500 3 ) \binom{500}{3} ( 3 500 ) .
- 4. The Hypergeometric Distribution: Finite-Lot Sampling Without Replacement
- Physical Modeling Conditions
In quality acceptance sampling, parts are drawn from a finite lot of size N N N without replacement. Because drawn parts are not replaced, the trials are dependent , and the probability of drawing a defective unit changes with every consecutive pick. This violates the binomial assumptions.
Let:
- N N N = total population (lot) size
- K K K = total number of successes (defective units) in the lot
- n n n = sample size drawn without replacement
- k k k = observed number of successes in the sample
Probability Mass Function, Mean, and Variance P ( X = k ) = ( K k ) ( N − K n − k ) ( N n ) , max ( 0 , n − ( N − K ) ) ≤ k ≤ min ( n , K ) P(X = k) = \frac{\binom{K}{k} \binom{N - K}{n - k}}{\binom{N}{n}}, \quad \max(0, n - (N - K)) \le k \le \min(n, K) P ( X = k ) = ( n N ) ( k K ) ( n − k N − K ) , max ( 0 , n − ( N − K )) ≤ k ≤ min ( n , K )
Mean : E ( X ) = μ = n ( K N ) = n p E(X) = \mu = n \left( \frac{K}{N} \right) = n p E ( X ) = μ = n ( N K ) = n p (where p = K / N p = K/N p = K / N is the initial lot fraction defective)
Variance : Var ( X ) = σ 2 = n ( K N ) ( 1 − K N ) ( N − n N − 1 ) = n p ( 1 − p ) ( N − n N − 1 ) \text{Var}(X) = \sigma^2 = n \left( \frac{K}{N} \right) \left( 1 - \frac{K}{N} \right) \left( \frac{N - n}{N - 1} \right) = n p (1 - p) \left( \frac{N - n}{N - 1} \right) Var ( X ) = σ 2 = n ( N K ) ( 1 − N K ) ( N − 1 N − n ) = n p ( 1 − p ) ( N − 1 N − n )
The Finite Population Correction (FPC) Factor
The term N − n N − 1 \frac{N - n}{N - 1} N − 1 N − n is known as the finite population correction (FPC) factor . Notice that:
As the population size N → ∞ N \to \infty N → ∞ , the FPC N − n N − 1 → 1 \frac{N - n}{N - 1} \to 1 N − 1 N − n → 1 , and the hypergeometric variance converges to the binomial variance n p ( 1 − p ) n p (1 - p) n p ( 1 − p ) .
General Rule : When the sampling fraction is small ( n / N ≤ 0.05 n / N \le 0.05 n / N ≤ 0.05 or 5 % 5\% 5% ), sampling without replacement can be modeled using the simpler Binomial distribution with minimal error.
- 5. Geometric and Negative Binomial Distributions
- The Geometric Distribution (Waiting for the First Success)
The geometric distribution models the number of Bernoulli trials X X X required to encounter the first success.
Assumptions : Independent trials, binary outcomes, constant success probability p p p per trial.
PMF (NCEES Trial Formulation) : For the first success occurring on trial k k k ( k − 1 k - 1 k − 1 consecutive failures followed by one success): P ( X = k ) = ( 1 − p ) k − 1 p , k = 1 , 2 , 3 , … P(X = k) = (1 - p)^{k - 1} p, \quad k = 1, 2, 3, \dots P ( X = k ) = ( 1 − p ) k − 1 p , k = 1 , 2 , 3 , …
Cumulative Distribution : P ( X ≤ k ) = 1 − ( 1 − p ) k P(X \le k) = 1 - (1 - p)^k P ( X ≤ k ) = 1 − ( 1 − p ) k
Tail Probability : P ( X > k ) = ( 1 − p ) k P(X > k) = (1 - p)^k P ( X > k ) = ( 1 − p ) k (probability of failing k k k consecutive trials)
Mean : E ( X ) = μ = 1 p E(X) = \mu = \frac{1}{p} E ( X ) = μ = p 1
Variance : Var ( X ) = σ 2 = 1 − p p 2 \text{Var}(X) = \sigma^2 = \frac{1 - p}{p^2} Var ( X ) = σ 2 = p 2 1 − p
Memoryless Property of the Geometric Distribution The geometric distribution is the only discrete distribution that possesses the memoryless property : P ( X > s + t ∣ X > s ) = P ( X > t ) P(X > s + t \mid X > s) = P(X > t) P ( X > s + t ∣ X > s ) = P ( X > t ) In an inspection process, if an inspector has already examined s = 20 s = 20 s = 20 parts without finding a defect, the probability of requiring at least t = 5 t = 5 t = 5 more trials to find the first defect is identical to starting fresh from trial zero. Past non-defective parts provide no accumulated "credit."
The Negative Binomial Distribution (Waiting for r r r Successes)
The negative binomial distribution generalizes the geometric distribution. It models the total number of trials X X X required to observe exactly r r r successes.
PMF : For the r r r -th success to occur on the k k k -th trial, exactly r − 1 r - 1 r − 1 successes must occur in the preceding k − 1 k - 1 k − 1 trials (which can happen in ( k − 1 r − 1 ) \binom{k - 1}{r - 1} ( r − 1 k − 1 ) ways), followed by a success on trial k k k : P ( X = k ) = ( k − 1 r − 1 ) p r ( 1 − p ) k − r , k = r , r + 1 , r + 2 , … P(X = k) = \binom{k - 1}{r - 1} p^r (1 - p)^{k - r}, \quad k = r, r + 1, r + 2, \dots P ( X = k ) = ( r − 1 k − 1 ) p r ( 1 − p ) k − r , k = r , r + 1 , r + 2 , …
Relationship to Geometric : A negative binomial variable is the sum of r r r independent and identically distributed geometric random variables ( X = G 1 + G 2 + ⋯ + G r X = G_1 + G_2 + \dots + G_r X = G 1 + G 2 + ⋯ + G r ).
Mean : E ( X ) = μ = r p E(X) = \mu = \frac{r}{p} E ( X ) = μ = p r
Variance : Var ( X ) = σ 2 = r ( 1 − p ) p 2 \text{Var}(X) = \sigma^2 = \frac{r(1 - p)}{p^2} Var ( X ) = σ 2 = p 2 r ( 1 − p )
6. Comparative Summary of Discrete Probability Distributions
Distribution Primary Physical Application Parameters PMF P ( X = k ) P(X = k) P ( X = k ) Mean E ( X ) E(X) E ( X ) Variance Var ( X ) \text{Var}(X) Var ( X )
Binomial Number of defectives in n n n independent draws with replacement n , p n, p n , p ( n k ) p k ( 1 − p ) n − k \binom{n}{k} p^k (1-p)^{n-k} ( k n ) p k ( 1 − p ) n − k n p n p n p n p ( 1 − p ) n p (1 - p) n p ( 1 − p )
Poisson Number of flaws or arrivals over continuous exposure interval λ \lambda λ λ k e − λ k ! \frac{\lambda^k e^{-\lambda}}{k!} k ! λ k e − λ λ \lambda λ λ \lambda λ
Hypergeometric Number of defectives in n n n draws from finite lot N N N without replacement N , K , n N, K, n N , K , n ( K k ) ( N − K n − k ) ( N n ) \frac{\binom{K}{k} \binom{N-K}{n-k}}{\binom{N}{n}} ( n N ) ( k K ) ( n − k N − K ) n ( K N ) n \left(\frac{K}{N}\right) n ( N K ) n ( K N ) ( 1 − K N ) ( N − n N − 1 ) n \left(\frac{K}{N}\right)\left(1 - \frac{K}{N}\right)\left(\frac{N-n}{N-1}\right) n ( N K ) ( 1 − N K ) ( N − 1 N − n )
Geometric Number of trials until the 1st defective item appears p p p ( 1 − p ) k − 1 p (1-p)^{k-1} p ( 1 − p ) k − 1 p 1 p \frac{1}{p} p 1 1 − p p 2 \frac{1-p}{p^2} p 2 1 − p
Negative Binomial Number of trials until the r r r -th defective item appears r , p r, p r , p ( k − 1 r − 1 ) p r ( 1 − p ) k − r \binom{k-1}{r-1} p^r (1-p)^{k-r} ( r − 1 k − 1 ) p r ( 1 − p ) k − r r p \frac{r}{p} p r r ( 1 − p ) p 2 \frac{r(1-p)}{p^2} p 2 r ( 1 − p )
- 7. Step-by-Step Worked Engineering Examples
- Worked Example 6.2.1: Binomial vs. Poisson Approximation in PCB Solder Defect Screening
Problem : A wave soldering process produces solder shorts on complex circuit boards at an average probability of p = 0.004 p = 0.004 p = 0.004 per solder joint. A single production board contains n = 500 n = 500 n = 500 solder joints.
Compute the exact Binomial probability that a finished board has at most 1 solder defect.
Compute the Poisson approximation for the same event and determine the percentage error.
Solution :
Exact Binomial Calculation :
Let X ∼ Bin ( 500 , 0.004 ) X \sim \text{Bin}(500, 0.004) X ∼ Bin ( 500 , 0.004 ) .
P ( X ≤ 1 ) = P ( X = 0 ) + P ( X = 1 ) P(X \le 1) = P(X = 0) + P(X = 1) P ( X ≤ 1 ) = P ( X = 0 ) + P ( X = 1 )
P ( X = 0 ) = ( 500 0 ) ( 0.004 ) 0 ( 0.996 ) 500 = ( 0.996 ) 500 ≈ 0.13482 P(X = 0) = \binom{500}{0} (0.004)^0 (0.996)^{500} = (0.996)^{500} \approx 0.13482 P ( X = 0 ) = ( 0 500 ) ( 0.004 ) 0 ( 0.996 ) 500 = ( 0.996 ) 500 ≈ 0.13482
P ( X = 1 ) = ( 500 1 ) ( 0.004 ) 1 ( 0.996 ) 499 = 500 × 0.004 × ( 0.996 ) 499 = 2.0 × 0.13536 ≈ 0.27071 P(X = 1) = \binom{500}{1} (0.004)^1 (0.996)^{499} = 500 \times 0.004 \times (0.996)^{499} = 2.0 \times 0.13536 \approx 0.27071 P ( X = 1 ) = ( 1 500 ) ( 0.004 ) 1 ( 0.996 ) 499 = 500 × 0.004 × ( 0.996 ) 499 = 2.0 × 0.13536 ≈ 0.27071
Total exact probability: P ( X ≤ 1 ) = 0.13482 + 0.27071 = 0.40553 ≈ 40.55 % P(X \le 1) = 0.13482 + 0.27071 = 0.40553 \approx 40.55\% P ( X ≤ 1 ) = 0.13482 + 0.27071 = 0.40553 ≈ 40.55%
Poisson Approximation Calculation :
Check conditions: n = 500 ≥ 20 n = 500 \ge 20 n = 500 ≥ 20 , p = 0.004 ≤ 0.05 p = 0.004 \le 0.05 p = 0.004 ≤ 0.05 , and n p = 500 ( 0.004 ) = 2.0 ≤ 10 n p = 500(0.004) = 2.0 \le 10 n p = 500 ( 0.004 ) = 2.0 ≤ 10 . The approximation is valid.
Set parameter λ = n p = 2.0 \lambda = n p = 2.0 λ = n p = 2.0 .
P ( Y ≤ 1 ) = P ( Y = 0 ) + P ( Y = 1 ) P(Y \le 1) = P(Y = 0) + P(Y = 1) P ( Y ≤ 1 ) = P ( Y = 0 ) + P ( Y = 1 )
P ( Y = 0 ) = 2.0 0 e − 2.0 0 ! = e − 2 ≈ 0.13534 P(Y = 0) = \frac{2.0^0 e^{-2.0}}{0!} = e^{-2} \approx 0.13534 P ( Y = 0 ) = 0 ! 2. 0 0 e − 2.0 = e − 2 ≈ 0.13534
P ( Y = 1 ) = 2.0 1 e − 2.0 1 ! = 2.0 e − 2 ≈ 0.27067 P(Y = 1) = \frac{2.0^1 e^{-2.0}}{1!} = 2.0 e^{-2} \approx 0.27067 P ( Y = 1 ) = 1 ! 2. 0 1 e − 2.0 = 2.0 e − 2 ≈ 0.27067
Total approximate probability: P ( Y ≤ 1 ) = 0.13534 + 0.27067 = 0.40601 ≈ 40.60 % P(Y \le 1) = 0.13534 + 0.27067 = 0.40601 \approx 40.60\% P ( Y ≤ 1 ) = 0.13534 + 0.27067 = 0.40601 ≈ 40.60%
Percentage Error Analysis : Error = ∣ 0.40601 − 0.40553 ∣ 0.40553 × 100 % = 0.00048 0.40553 × 100 % ≈ 0.12 % \text{Error} = \frac{|0.40601 - 0.40553|}{0.40553} \times 100\% = \frac{0.00048}{0.40553} \times 100\% \approx 0.12\% Error = 0.40553 ∣0.40601 − 0.40553∣ × 100% = 0.40553 0.00048 × 100% ≈ 0.12% Engineering Conclusion : The Poisson model provides extreme precision (within 0.2 % 0.2\% 0.2% ) while avoiding tedious binomial expansions.
Worked Example 6.2.2: Hypergeometric Lot Acceptance Sampling for Aerospace Fasteners
Problem : A small incoming shipment of N = 20 N = 20 N = 20 titanium aerospace bolts contains exactly K = 4 K = 4 K = 4 non-conforming bolts with defective thread pitch. An incoming receiving inspector selects a random sample of n = 3 n = 3 n = 3 bolts without replacement. What is the probability that the sample contains at most 1 defective bolt?
Solution :
Identify Model Parameters :
- Population N = 20 N = 20 N = 20
- Defective units in population K = 4 K = 4 K = 4
- Conforming units in population N − K = 16 N - K = 16 N − K = 16
- Sample size n = 3 n = 3 n = 3
We require P ( X ≤ 1 ) = P ( X = 0 ) + P ( X = 1 ) P(X \le 1) = P(X = 0) + P(X = 1) P ( X ≤ 1 ) = P ( X = 0 ) + P ( X = 1 ) .
Calculate Total Sample Combinations : ( N n ) = ( 20 3 ) = 20 × 19 × 18 3 × 2 × 1 = 20 × 19 × 3 = 1,140 \binom{N}{n} = \binom{20}{3} = \frac{20 \times 19 \times 18}{3 \times 2 \times 1} = 20 \times 19 \times 3 = 1{,}140 ( n N ) = ( 3 20 ) = 3 × 2 × 1 20 × 19 × 18 = 20 × 19 × 3 = 1 , 140
Compute P ( X = 0 ) P(X = 0) P ( X = 0 ) (Zero Defects) : ( K 0 ) = ( 4 0 ) = 1 , ( N − K n − 0 ) = ( 16 3 ) = 16 × 15 × 14 3 × 2 × 1 = 560 \binom{K}{0} = \binom{4}{0} = 1, \quad \binom{N - K}{n - 0} = \binom{16}{3} = \frac{16 \times 15 \times 14}{3 \times 2 \times 1} = 560 ( 0 K ) = ( 0 4 ) = 1 , ( n − 0 N − K ) = ( 3 16 ) = 3 × 2 × 1 16 × 15 × 14 = 560 P ( X = 0 ) = 1 × 560 1,140 = 560 1,140 ≈ 0.49123 P(X = 0) = \frac{1 \times 560}{1{,}140} = \frac{560}{1{,}140} \approx 0.49123 P ( X = 0 ) = 1 , 140 1 × 560 = 1 , 140 560 ≈ 0.49123
Compute P ( X = 1 ) P(X = 1) P ( X = 1 ) (Exactly One Defect) : ( K 1 ) = ( 4 1 ) = 4 , ( N − K n − 1 ) = ( 16 2 ) = 16 × 15 2 × 1 = 120 \binom{K}{1} = \binom{4}{1} = 4, \quad \binom{N - K}{n - 1} = \binom{16}{2} = \frac{16 \times 15}{2 \times 1} = 120 ( 1 K ) = ( 1 4 ) = 4 , ( n − 1 N − K ) = ( 2 16 ) = 2 × 1 16 × 15 = 120 P ( X = 1 ) = 4 × 120 1,140 = 480 1,140 ≈ 0.42105 P(X = 1) = \frac{4 \times 120}{1{,}140} = \frac{480}{1{,}140} \approx 0.42105 P ( X = 1 ) = 1 , 140 4 × 120 = 1 , 140 480 ≈ 0.42105
Sum Cumulative Probability : P ( X ≤ 1 ) = 560 + 480 1,140 = 1,040 1,140 = 52 57 ≈ 0.91228 P(X \le 1) = \frac{560 + 480}{1{,}140} = \frac{1{,}040}{1{,}140} = \frac{52}{57} \approx 0.91228 P ( X ≤ 1 ) = 1 , 140 560 + 480 = 1 , 140 1 , 040 = 57 52 ≈ 0.91228
Final Result : The probability of accepting the lot under a c = 1 c = 1 c = 1 threshold is 91.23 % 91.23\% 91.23% .
8. NCEES Reference Handbook Tips & Realistic Exam Traps
Binomial vs. Hypergeometric Distinction : Always look for the phrasing "without replacement from a lot of size N" . If N N N is small (e.g., N = 20 N = 20 N = 20 or N = 50 N = 50 N = 50 ), you MUST use the hypergeometric distribution. If sampling occurs with replacement , or from a continuous production flow where N N N is practically infinite, use the binomial distribution.
Poisson Rate Scaling Errors : The parameter λ \lambda λ must always match the physical unit of exposure in the question. If defects occur at 1.5 defects/meter 1.5\text{ defects/meter} 1.5 defects/meter , and the problem asks for the probability of defects on a 4 -meter 4\text{-meter} 4 -meter pipe, λ = 1.5 × 4 = 6.0 \lambda = 1.5 \times 4 = 6.0 λ = 1.5 × 4 = 6.0 . Using λ = 1.5 \lambda = 1.5 λ = 1.5 directly is an intentional distractor trap on the exam.
Cumulative Phrasing Traps :
"At most k k k " means P ( X ≤ k ) = P ( 0 ) + P ( 1 ) + ⋯ + P ( k ) P(X \le k) = P(0) + P(1) + \dots + P(k) P ( X ≤ k ) = P ( 0 ) + P ( 1 ) + ⋯ + P ( k ) .
"Fewer than k k k " means P ( X < k ) = P ( X ≤ k − 1 ) P(X < k) = P(X \le k - 1) P ( X < k ) = P ( X ≤ k − 1 ) .
"At least k k k " means P ( X ≥ k ) = 1 − P ( X ≤ k − 1 ) P(X \ge k) = 1 - P(X \le k - 1) P ( X ≥ k ) = 1 − P ( X ≤ k − 1 ) .
"More than k k k " means P ( X > k ) = 1 − P ( X ≤ k ) P(X > k) = 1 - P(X \le k) P ( X > k ) = 1 − P ( X ≤ k ) .
Geometric Mean Formulation : The NCEES Reference Handbook uses the trial formulation E ( X ) = 1 / p E(X) = 1/p E ( X ) = 1/ p , where X X X is the trial on which the first success occurs ( X ∈ { 1 , 2 , … } X \in \{1, 2, \dots\} X ∈ { 1 , 2 , … } ). Some outside textbooks define Y Y Y as the number of failures before the first success ( Y ∈ { 0 , 1 , … } Y \in \{0, 1, \dots\} Y ∈ { 0 , 1 , … } ), giving E ( Y ) = ( 1 − p ) / p E(Y) = (1 - p)/p E ( Y ) = ( 1 − p ) / p . For the FE exam, always follow the trial formulation ( 1 / p 1/p 1/ p ).