Study guide
6.1 Basic Probability Concepts, Conditional Probability, and Bayes' Theorem
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.1 Basic Probability Concepts, Conditional Probability, and Bayes' Theorem
Key Takeaways Explain This Topic AI
The sample space S encapsulates all possible elementary outcomes of a random experiment; mutually exclusive events cannot occur simultaneously (A ∩ B = ∅), whereas independent events satisfy P(A ∩ B) = P(A)P(B).
Kolmogorov's axioms dictate that probabilities are non-negative (0 ≤ P(A) ≤ 1), total probability equals unity (P(S) = 1), and the probability of the union of mutually exclusive events is the sum of their individual probabilities.
The general addition rule P(A ∪ B) = P(A) + P(B) - P(A ∩ B) corrects for double-counting; the subtraction term drops to zero only when events are disjoint.
Conditional probability P(A|B) = P(A ∩ B) / P(B) normalizes the probability of A given that event B has occurred; the Law of Total Probability partitions the sample space to find unconditional probabilities: P(A) = Σ P(A|Bi)P(Bi).
Bayes' Theorem updates a prior probability into a posterior probability based on new diagnostic evidence: P(Bj|A) = [P(A|Bj)P(Bj)] / Σ [P(A|Bi)P(Bi)], exposing the base rate fallacy in automated inspection systems where low defect rates yield high proportions of false alarms.
Last updated: September 2026
Probability theory provides the mathematical language for quantifying uncertainty, risk, and variability in industrial and systems engineering. Whether evaluating automated inspection error rates, modeling machine breakdown frequencies, or designing acceptance sampling plans for incoming lots, industrial engineers must apply probability fundamentals with absolute mathematical precision. The NCEES FE Reference Handbook collects these core relationships under its Engineering Probability and Statistics section. Mastering these concepts is critical for solving both direct probability problems and advanced stochastic modeling questions on the FE Industrial examination.
- 1. Sample Spaces, Events, and Set Operations
- Elementary Definitions
A random experiment is an observational process whose outcome cannot be predicted with certainty in advance, yet the set of all potential outcomes is known.
Sample Space ( S S S ) : The set of all possible elementary outcomes of a random experiment. For example, when inspecting three consecutive stamped brackets for dimensional compliance, S = { CCC , CCD , CDC , CDD , DCC , DCD , DDC , DDD } S = \{\text{CCC}, \text{CCD}, \text{CDC}, \text{CDD}, \text{DCC}, \text{DCD}, \text{DDC}, \text{DDD}\} S = { CCC , CCD , CDC , CDD , DCC , DCD , DDC , DDD } , where C \text{C} C denotes conforming and D \text{D} D denotes defective.
Event ( A , B , … A, B, \dots A , B , … ) : Any subset of the sample space S S S . An event occurs if the actual outcome of the experiment belongs to that subset.
Null Event ( ∅ \emptyset ∅ ) : The empty set containing no outcomes, with probability P ( ∅ ) = 0 P(\emptyset) = 0 P ( ∅ ) = 0 .
Complement ( A c A^c A c or A ′ A' A ′ ) : The set of all outcomes in S S S that do not belong to A A A . Consequently, P ( A c ) = 1 − P ( A ) P(A^c) = 1 - P(A) P ( A c ) = 1 − P ( A ) .
Set Operations in Engineering Contexts
Probability operations closely map to Boolean logic and Venn diagram relationships:
Union ( A ∪ B A \cup B A ∪ B ) : The event containing all outcomes in A A A , in B B B , or in both ( A OR B A \text{ OR } B A OR B ). In a quality audit, this represents a component failing either Test 1, Test 2, or both.
Intersection ( A ∩ B A \cap B A ∩ B or A B AB A B ) : The event containing all outcomes belonging to both A A A and B B B concurrently ( A AND B A \text{ AND } B A AND B ). In a redundant safety interlock, this represents both sensor A A A and sensor B B B tripping simultaneously.
Mutually Exclusive (Disjoint) Events : Two events A A A and B B B are mutually exclusive if they share no common outcomes: A ∩ B = ∅ ⟹ P ( A ∩ B ) = 0 A \cap B = \emptyset \quad \implies \quad P(A \cap B) = 0 A ∩ B = ∅ ⟹ P ( A ∩ B ) = 0 Example : A machined shaft cannot simultaneously measure undersized ( A A A ) and oversized ( B B B ) on the same diameter check.
Independent Events : Two events A A A and B B B are independent if the occurrence of one provides no mathematical information regarding the occurrence of the other: P ( A ∩ B ) = P ( A ) ⋅ P ( B ) ⟺ P ( A ∣ B ) = P ( A ) P(A \cap B) = P(A) \cdot P(B) \quad \iff \quad P(A|B) = P(A) P ( A ∩ B ) = P ( A ) ⋅ P ( B ) ⟺ P ( A ∣ B ) = P ( A )
Exam Watchout: Mutually Exclusive vs. Independent Events A perennial distractor on the FE exam conflates mutually exclusive events with independent events. If two events A A A and B B B have non-zero probabilities ( P ( A ) > 0 P(A) > 0 P ( A ) > 0 and P ( B ) > 0 P(B) > 0 P ( B ) > 0 ) and are mutually exclusive , they can never be independent! Because P ( A ∩ B ) = 0 P(A \cap B) = 0 P ( A ∩ B ) = 0 while P ( A ) P ( B ) > 0 P(A)P(B) > 0 P ( A ) P ( B ) > 0 , knowing that A A A occurred guarantees that B B B could not have occurred. Mutually exclusive events are therefore strongly dependent.
2. Axioms of Probability and Elementary Theorems
Modern probability rests on Kolmogorov's three fundamental axioms. For a sample space S S S and events defined on S S S :
- Axiom 1 (Non-negativity) : For every event A A A , 0 ≤ P ( A ) ≤ 1 0 \le P(A) \le 1 0 ≤ P ( A ) ≤ 1
- Axiom 2 (Certainty) : The probability of the entire sample space is unity, P ( S ) = 1 P(S) = 1 P ( S ) = 1
Axiom 3 (Countable Additivity) : If A 1 , A 2 , A 3 , … A_1, A_2, A_3, \dots A 1 , A 2 , A 3 , … is a sequence of mutually exclusive (pairwise disjoint) events, then: P ( ⋃ i = 1 ∞ A i ) = ∑ i = 1 ∞ P ( A i ) P\left(\bigcup_{i=1}^{\infty} A_i\right) = \sum_{i=1}^{\infty} P(A_i) P ( i = 1 ⋃ ∞ A i ) = i = 1 ∑ ∞ P ( A i )
Fundamental Corollaries
From these three axioms, several practical algebraic properties follow directly:
Complement Rule : P ( A c ) = 1 − P ( A ) P(A^c) = 1 - P(A) P ( A c ) = 1 − P ( A ) . When solving complex reliability or quality problems where calculating "at least one failure" directly requires enumerating multiple compound combinations, calculate the complement "zero failures" instead: P ( at least one ) = 1 − P ( none ) P(\text{at least one}) = 1 - P(\text{none}) P ( at least one ) = 1 − P ( none ) .
Monotonicity : If event A ⊆ B A \subseteq B A ⊆ B , then P ( A ) ≤ P ( B ) P(A) \le P(B) P ( A ) ≤ P ( B ) .
Bounded Range : P ( A ∖ B ) = P ( A ∩ B c ) = P ( A ) − P ( A ∩ B ) P(A \setminus B) = P(A \cap B^c) = P(A) - P(A \cap B) P ( A ∖ B ) = P ( A ∩ B c ) = P ( A ) − P ( A ∩ B ) .
- 3. Addition and Multiplication Rules
- The General Addition Rule
For any two arbitrary events A A A and B B B (whether mutually exclusive or not): P ( A ∪ B ) = P ( A ) + P ( B ) − P ( A ∩ B ) P(A \cup B) = P(A) + P(B) - P(A \cap B) P ( A ∪ B ) = P ( A ) + P ( B ) − P ( A ∩ B )
The subtraction term − P ( A ∩ B ) -P(A \cap B) − P ( A ∩ B ) eliminates the double-counting of outcomes lying within both sets. If A A A and B B B are mutually exclusive, P ( A ∩ B ) = 0 P(A \cap B) = 0 P ( A ∩ B ) = 0 , reducing the expression to P ( A ∪ B ) = P ( A ) + P ( B ) P(A \cup B) = P(A) + P(B) P ( A ∪ B ) = P ( A ) + P ( B ) .
For three events A A A , B B B , and C C C , the Principle of Inclusion-Exclusion expands to: P ( A ∪ B ∪ C ) = P ( A ) + P ( B ) + P ( C ) − P ( A ∩ B ) − P ( A ∩ C ) − P ( B ∩ C ) + P ( A ∩ B ∩ C ) P(A \cup B \cup C) = P(A) + P(B) + P(C) - P(A \cap B) - P(A \cap C) - P(B \cap C) + P(A \cap B \cap C) P ( A ∪ B ∪ C ) = P ( A ) + P ( B ) + P ( C ) − P ( A ∩ B ) − P ( A ∩ C ) − P ( B ∩ C ) + P ( A ∩ B ∩ C )
The Multiplication Rule
The probability of the simultaneous occurrence of two events A A A and B B B is determined by the multiplication rule: P ( A ∩ B ) = P ( A ∣ B ) ⋅ P ( B ) = P ( B ∣ A ) ⋅ P ( A ) P(A \cap B) = P(A|B) \cdot P(B) = P(B|A) \cdot P(A) P ( A ∩ B ) = P ( A ∣ B ) ⋅ P ( B ) = P ( B ∣ A ) ⋅ P ( A )
If events A A A and B B B are statistically independent, the conditional probability simplifies to P ( A ∣ B ) = P ( A ) P(A|B) = P(A) P ( A ∣ B ) = P ( A ) , yielding the special multiplication rule: P ( A ∩ B ) = P ( A ) ⋅ P ( B ) P(A \cap B) = P(A) \cdot P(B) P ( A ∩ B ) = P ( A ) ⋅ P ( B )
For k k k mutually independent events E 1 , E 2 , … , E k E_1, E_2, \dots, E_k E 1 , E 2 , … , E k : P ( E 1 ∩ E 2 ∩ ⋯ ∩ E k ) = ∏ i = 1 k P ( E i ) P(E_1 \cap E_2 \cap \dots \cap E_k) = \prod_{i=1}^k P(E_i) P ( E 1 ∩ E 2 ∩ ⋯ ∩ E k ) = i = 1 ∏ k P ( E i ) ┌── Mutually Exclusive: P(A ∩ B) = 0 ──> P(A ∪ B) = P(A) + P(B)
- Union: P(A ∪ B) ────┤
- └── Non-Disjoint: P(A ∩ B) > 0 ────────> P(A ∪ B) = P(A) + P(B) - P(A ∩ B)
- ┌── Independent: P(A|B) = P(A) ────> P(A ∩ B) = P(A) * P(B)
- Intersection: P(A ∩ B) ─┤
- └── Dependent: P(A|B) ≠ P(A) ──────> P(A ∩ B) = P(A|B) * P(B)
- 4. Conditional Probability and the Law of Total Probability
- Conditional Probability
The conditional probability of event A A A given that event B B B has already occurred, denoted P ( A ∣ B ) P(A|B) P ( A ∣ B ) , is defined formally as: P ( A ∣ B ) = P ( A ∩ B ) P ( B ) , provided P ( B ) > 0 P(A|B) = \frac{P(A \cap B)}{P(B)}, \quad \text{provided } P(B) > 0 P ( A ∣ B ) = P ( B ) P ( A ∩ B ) , provided P ( B ) > 0
Conditioning effectively shrinks the sample space from the universal space S S S down to the restricted sub-space defined by B B B . All outcomes outside of B B B are discarded, and probabilities within B B B are scaled by 1 / P ( B ) 1 / P(B) 1/ P ( B ) so they sum to 1 1 1 .
Law of Total Probability
Let the events B 1 , B 2 , … , B k B_1, B_2, \dots, B_k B 1 , B 2 , … , B k form a partition of the sample space S S S . That is:
The sets are pairwise mutually exclusive: B i ∩ B j = ∅ B_i \cap B_j = \emptyset B i ∩ B j = ∅ for all i ≠ j i \neq j i = j .
Their union is the entire sample space: ⋃ i = 1 k B i = S \bigcup_{i=1}^k B_i = S ⋃ i = 1 k B i = S .
Each partition set has non-zero probability: P ( B i ) > 0 P(B_i) > 0 P ( B i ) > 0 for all i i i .
Then for any arbitrary event A A A in the same sample space: P ( A ) = ∑ i = 1 k P ( A ∩ B i ) = ∑ i = 1 k P ( A ∣ B i ) P ( B i ) P(A) = \sum_{i=1}^k P(A \cap B_i) = \sum_{i=1}^k P(A|B_i) P(B_i) P ( A ) = i = 1 ∑ k P ( A ∩ B i ) = i = 1 ∑ k P ( A ∣ B i ) P ( B i )
In manufacturing facilities, the Law of Total Probability routinely computes the overall defect rate across multiple parallel production lines. If Line 1, Line 2, and Line 3 fabricate 50 % 50\% 50% , 30 % 30\% 30% , and 20 % 20\% 20% of daily output respectively, each with its own known defect rate, the overall facility scrap rate is the weighted average calculated via this law.
- 5. Bayes' Theorem and Diagnostic Screening in Industrial Quality Control
- Mathematical Formulation
Combining the definition of conditional probability with the Law of Total Probability yields Bayes' Theorem : P ( B j ∣ A ) = P ( A ∩ B j ) P ( A ) = P ( A ∣ B j ) P ( B j ) ∑ i = 1 k P ( A ∣ B i ) P ( B i ) P(B_j|A) = \frac{P(A \cap B_j)}{P(A)} = \frac{P(A|B_j) P(B_j)}{\sum_{i=1}^k P(A|B_i) P(B_i)} P ( B j ∣ A ) = P ( A ) P ( A ∩ B j ) = ∑ i = 1 k P ( A ∣ B i ) P ( B i ) P ( A ∣ B j ) P ( B j )
Prior Probability ( P ( B j ) P(B_j) P ( B j ) ) : The baseline probability of state B j B_j B j before observing new experimental evidence A A A .
Likelihood ( P ( A ∣ B j ) P(A|B_j) P ( A ∣ B j ) ) : The probability that test result A A A occurs given that true state B j B_j B j exists.
Marginal Probability ( P ( A ) P(A) P ( A ) ) : The total unconditional probability of observing test result A A A , evaluated across all possible states.
Posterior Probability ( P ( B j ∣ A ) P(B_j|A) P ( B j ∣ A ) ) : The updated probability of state B j B_j B j after observing and conditioning on evidence A A A .
Diagnostic Screening and Quality Inspection Metrics
Industrial automated testing and non-destructive evaluation (NDE) systems rely heavily on Bayesian analysis to evaluate screening performance:
Quality Engineering Term Diagnostic / Medical Analog Mathematical Definition
True Positive Rate (Sensitivity) Sensitivity P ( T + ∣ D ) P(T^+ \vert D) P ( T + ∣ D ) (Alarm triggered given component is defective)
True Negative Rate (Specificity) Specificity P ( T − ∣ D c ) P(T^- \vert D^c) P ( T − ∣ D c ) (No alarm given component is conforming)
False Positive Rate (Producer's Risk / α \alpha α ) Type I Error ( 1 − Specificity 1 - \text{Specificity} 1 − Specificity ) P ( T + ∣ D c ) P(T^+ \vert D^c) P ( T + ∣ D c ) (Alarm triggered on conforming component)
False Negative Rate (Consumer's Risk / β \beta β ) Type II Error ( 1 − Sensitivity 1 - \text{Sensitivity} 1 − Sensitivity ) P ( T − ∣ D ) P(T^- \vert D) P ( T − ∣ D ) (Defective component passes undetected)
Positive Predictive Value (PPV) Posterior Probability P ( D ∣ T + ) P(D \vert T^+) P ( D ∣ T + ) (Probability that an alarmed unit is truly defective) PPV = P ( D ∣ T + ) = P ( T + ∣ D ) P ( D ) P ( T + ∣ D ) P ( D ) + P ( T + ∣ D c ) P ( D c ) \text{PPV} = P(D|T^+) = \frac{P(T^+|D) P(D)}{P(T^+|D) P(D) + P(T^+|D^c) P(D^c)} PPV = P ( D ∣ T + ) = P ( T + ∣ D ) P ( D ) + P ( T + ∣ D c ) P ( D c ) P ( T + ∣ D ) P ( D )
The Base Rate Fallacy in Quality Control When the baseline defect rate (the prior P ( D ) P(D) P ( D ) ) is very low—such as 1 % 1\% 1% or 0.1 % 0.1\% 0.1% in a high-yield semiconductor fab—even a highly accurate testing machine (e.g., 99 % 99\% 99% sensitivity and 95 % 95\% 95% specificity) will produce more false alarms than true defect detections. An engineer who assumes that an alarmed component has a 99 % 99\% 99% chance of being defective commits the base rate fallacy by ignoring the dominant volume of conforming parts generating false alarms.
6. Combinatorics in Systems Engineering: Permutations and Combinations
Counting the total number of sample points in complex sample spaces requires combinatorial formulas.
Fundamental Counting Principle (Multiplication Rule of Counting)
If an operation can be performed in n 1 n_1 n 1 ways, a second operation in n 2 n_2 n 2 ways, and so on up to a k k k -th operation in n k n_k n k ways, the total sequence of operations can be carried out in: N = n 1 × n 2 × n 3 × ⋯ × n k N = n_1 \times n_2 \times n_3 \times \dots \times n_k N = n 1 × n 2 × n 3 × ⋯ × n k
Permutations (Order Matters)
A permutation is an ordered arrangement of distinct objects:
Permutations of n n n distinct objects taken r r r at a time : P ( n , r ) = n P r = n ! ( n − r ) ! = n ( n − 1 ) ( n − 2 ) … ( n − r + 1 ) P(n, r) = {}_n P_r = \frac{n!}{(n - r)!} = n(n - 1)(n - 2)\dots(n - r + 1) P ( n , r ) = n P r = ( n − r )! n ! = n ( n − 1 ) ( n − 2 ) … ( n − r + 1 )
Permutations of n n n objects with identical subsets (multinomial arrangements): When arranging n n n items where n 1 n_1 n 1 are of type 1, n 2 n_2 n 2 are of type 2, … \dots … , and n k n_k n k are of type k k k (with ∑ n i = n \sum n_i = n ∑ n i = n ): P = n ! n 1 ! n 2 ! … n k ! P = \frac{n!}{n_1! \, n_2! \, \dots \, n_k!} P = n 1 ! n 2 ! … n k ! n ! Industrial Application : Sequencing production jobs through a dedicated machine where several jobs belong to identical part families.
Combinations (Order Does NOT Matter)
A combination is a selection of r r r objects from a collection of n n n distinct objects where the sequence of selection is irrelevant: C ( n , r ) = ( n r ) = n C r = n ! r ! ( n − r ) ! = P ( n , r ) r ! C(n, r) = \binom{n}{r} = {}_n C_r = \frac{n!}{r! \, (n - r)!} = \frac{P(n, r)}{r!} C ( n , r ) = ( r n ) = n C r = r ! ( n − r )! n ! = r ! P ( n , r )
Key algebraic properties:
- ( n r ) = ( n n − r ) \binom{n}{r} = \binom{n}{n - r} ( r n ) = ( n − r n )
- ( n 0 ) = ( n n ) = 1 \binom{n}{0} = \binom{n}{n} = 1 ( 0 n ) = ( n n ) = 1
∑ r = 0 n ( n r ) = 2 n \sum_{r=0}^n \binom{n}{r} = 2^n ∑ r = 0 n ( r n ) = 2 n (the total number of all possible subsets of an n n n -element set)
- 7. Step-by-Step Worked Engineering Examples
- Worked Example 6.1.1: Automated Optical Inspection (AOI) Bayesian Quality Audit
Problem : An automated optical inspection (AOI) system screens printed circuit boards (PCBs) on an assembly line. Production data shows that 2.0 % 2.0\% 2.0% of boards have solder bridge defects ( P ( D ) = 0.02 P(D) = 0.02 P ( D ) = 0.02 ). The manufacturer's validation testing demonstrates:
The system correctly flags a defective board 95.0 % 95.0\% 95.0% of the time ( P ( T + ∣ D ) = 0.95 P(T^+|D) = 0.95 P ( T + ∣ D ) = 0.95 , True Positive Rate).
The system incorrectly flags a conforming board 4.0 % 4.0\% 4.0% of the time ( P ( T + ∣ D c ) = 0.04 P(T^+|D^c) = 0.04 P ( T + ∣ D c ) = 0.04 , False Positive Rate).
If a board causes the AOI system to sound an alarm ( T + T^+ T + ), what is the probability that the board actually contains a solder bridge defect?
Solution :
Identify the Given Probabilities :
- Prior defect probability: P ( D ) = 0.02 P(D) = 0.02 P ( D ) = 0.02
- Prior conforming probability: P ( D c ) = 1 − 0.02 = 0.98 P(D^c) = 1 - 0.02 = 0.98 P ( D c ) = 1 − 0.02 = 0.98
- Likelihood given defect: P ( T + ∣ D ) = 0.95 P(T^+|D) = 0.95 P ( T + ∣ D ) = 0.95
- Likelihood given non-defect: P ( T + ∣ D c ) = 0.04 P(T^+|D^c) = 0.04 P ( T + ∣ D c ) = 0.04
Apply the Law of Total Probability to find the denominator P ( T + ) P(T^+) P ( T + ) : P ( T + ) = P ( T + ∣ D ) P ( D ) + P ( T + ∣ D c ) P ( D c ) P(T^+) = P(T^+|D)P(D) + P(T^+|D^c)P(D^c) P ( T + ) = P ( T + ∣ D ) P ( D ) + P ( T + ∣ D c ) P ( D c ) P ( T + ) = ( 0.95 ) ( 0.02 ) + ( 0.04 ) ( 0.98 ) P(T^+) = (0.95)(0.02) + (0.04)(0.98) P ( T + ) = ( 0.95 ) ( 0.02 ) + ( 0.04 ) ( 0.98 ) P ( T + ) = 0.0190 + 0.0392 = 0.0582 P(T^+) = 0.0190 + 0.0392 = 0.0582 P ( T + ) = 0.0190 + 0.0392 = 0.0582 Engineering Interpretation : Out of every 10,000 10{,}000 10 , 000 boards inspected, 582 582 582 trigger an alarm: 190 190 190 are true defects, while 392 392 392 are false alarms.
Apply Bayes' Theorem to compute posterior probability P ( D ∣ T + ) P(D|T^+) P ( D ∣ T + ) : P ( D ∣ T + ) = P ( T + ∣ D ) P ( D ) P ( T + ) = 0.0190 0.0582 = 190 582 ≈ 0.32646 P(D|T^+) = \frac{P(T^+|D)P(D)}{P(T^+)} = \frac{0.0190}{0.0582} = \frac{190}{582} \approx 0.32646 P ( D ∣ T + ) = P ( T + ) P ( T + ∣ D ) P ( D ) = 0.0582 0.0190 = 582 190 ≈ 0.32646
Final Result : The probability that an alarmed board is truly defective is approximately 32.65 % 32.65\% 32.65% . Takeaway : Despite a 95 % 95\% 95% detection rate and a low 4 % 4\% 4% false alarm rate, nearly two-thirds ( 67.35 % 67.35\% 67.35% ) of all flagged boards are false alarms because true defects are rare in the overall population.
Worked Example 6.1.2: Combinatorial Line Balancing and Inspection Routing
Problem : A systems quality department consists of 10 10 10 certified quality technicians. A specialized line audit team requires 4 4 4 technicians. Within this chosen team of 4 4 4 , one technician must be designated as the Lead Auditor, and one must be designated as the Data Analyst. The remaining two serve as Field Inspectors. How many distinct audited team configurations are possible?
Solution :
Method 1: Two-Stage Selection (Combinations followed by Permutations) :
Step 1: Select 4 4 4 technicians out of the available 10 10 10 regardless of role: C ( 10 , 4 ) = 10 ! 4 ! 6 ! = 10 × 9 × 8 × 7 4 × 3 × 2 × 1 = 210 C(10, 4) = \frac{10!}{4! \, 6!} = \frac{10 \times 9 \times 8 \times 7}{4 \times 3 \times 2 \times 1} = 210 C ( 10 , 4 ) = 4 ! 6 ! 10 ! = 4 × 3 × 2 × 1 10 × 9 × 8 × 7 = 210
Step 2: From the 4 4 4 selected technicians, assign the 2 2 2 unique functional roles (Lead Auditor and Data Analyst). This is an ordered arrangement: P ( 4 , 2 ) = 4 ! ( 4 − 2 ) ! = 4 × 3 = 12 P(4, 2) = \frac{4!}{(4 - 2)!} = 4 \times 3 = 12 P ( 4 , 2 ) = ( 4 − 2 )! 4 ! = 4 × 3 = 12 (The remaining 2 2 2 technicians automatically fill the indistinguishable Field Inspector positions: C ( 2 , 2 ) = 1 C(2, 2) = 1 C ( 2 , 2 ) = 1 ).
Step 3: Multiply the independent selection stages: N = C ( 10 , 4 ) × P ( 4 , 2 ) = 210 × 12 = 2,520 N = C(10, 4) \times P(4, 2) = 210 \times 12 = 2{,}520 N = C ( 10 , 4 ) × P ( 4 , 2 ) = 210 × 12 = 2 , 520
Method 2: Direct Ordered Assignment :
Choose Lead Auditor from 10 10 10 candidates: 10 10 10 options.
Choose Data Analyst from remaining 9 9 9 candidates: 9 9 9 options.
Choose 2 2 2 Field Inspectors from remaining 8 8 8 candidates without regard to order: C ( 8 , 2 ) = 8 × 7 2 × 1 = 28 C(8, 2) = \frac{8 \times 7}{2 \times 1} = 28 C ( 8 , 2 ) = 2 × 1 8 × 7 = 28
Multiply total choices: N = 10 × 9 × 28 = 90 × 28 = 2,520 N = 10 \times 9 \times 28 = 90 \times 28 = 2{,}520 N = 10 × 9 × 28 = 90 × 28 = 2 , 520 .
Final Answer : Exactly 2,520 2{,}520 2 , 520 unique team configurations can be formed.
8. NCEES Reference Handbook Tips & Realistic Exam Traps
The Base Rate Neglect Trap : On conditional probability questions involving testing or inspection, do not equate the probability of failing an inspection given a defect ( P ( T + ∣ D ) P(T^+|D) P ( T + ∣ D ) ) with the probability of having a defect given failure ( P ( D ∣ T + ) P(D|T^+) P ( D ∣ T + ) ). Flipping these conditional terms is known as the prosecutor's fallacy or inspection inversion and is the most common wrong answer choice.
Disjoint vs. Independent Addition Trap : When applying the addition rule P ( A ∪ B ) = P ( A ) + P ( B ) − P ( A ∩ B ) P(A \cup B) = P(A) + P(B) - P(A \cap B) P ( A ∪ B ) = P ( A ) + P ( B ) − P ( A ∩ B ) , never assume P ( A ∩ B ) = 0 P(A \cap B) = 0 P ( A ∩ B ) = 0 unless the problem explicitly states the events cannot occur simultaneously. If the problem states the events are independent, P ( A ∩ B ) = P ( A ) P ( B ) P(A \cap B) = P(A)P(B) P ( A ∩ B ) = P ( A ) P ( B ) , so P ( A ∪ B ) = P ( A ) + P ( B ) − P ( A ) P ( B ) P(A \cup B) = P(A) + P(B) - P(A)P(B) P ( A ∪ B ) = P ( A ) + P ( B ) − P ( A ) P ( B ) .
Order Matters Check for Counting : When solving combinatorics problems, immediately ask: Does changing the order create a new outcome? If assigning distinct titles, stations, or sequential time slots, use permutations ( P ( n , r ) P(n, r) P ( n , r ) ). If choosing an unranked committee, sample batch, or inspection group, use combinations ( C ( n , r ) C(n, r) C ( n , r ) ).
At-Least-One Shortcut : When asked for the probability of observing "at least one defective item in a batch of n n n ", do not compute ∑ k = 1 n P ( X = k ) \sum_{k=1}^n P(X = k) ∑ k = 1 n P ( X = k ) . Use the complement: P ( X ≥ 1 ) = 1 − P ( X = 0 ) = 1 − ( 1 − p ) n P(X \ge 1) = 1 - P(X = 0) = 1 - (1 - p)^n P ( X ≥ 1 ) = 1 − P ( X = 0 ) = 1 − ( 1 − p ) n . This saves 3 to 4 minutes of calculation time on the exam.