Sampling fraction
When the sample is tiny relative to the lot, a binomial approximation may be close. As the fraction grows, without-replacement dependence materially reduces variance.
Probability
Calculate the exact hypergeometric distribution for defective units in a random sample drawn without replacement from a finite lot.
FINITE-LOT SAMPLE DISTRIBUTION
Use a fixed lot composition and a simple random sample. The calculator normalizes stable log-combination weights, reports exact point and tail probabilities, and reconciles the full outcome table to the analytic mean.
LIVE DECISION RECORD
Every feasible sample defect count with exact probability, cumulative probability, upper tail, and distance from the expected count.
| Sample defects x | P(X = x) | P(X <= x) | P(X >= x) | Position |
|---|
CURRENT CALCULATION PROCESS
P(X=x) = C(D,x) C(N-D,n-x) / C(N,n); E[X] = nD/N
| Symbol | Meaning and unit | Current value |
|---|---|---|
| N | Finite lot size, units | 100 |
| D | Known lot defective units | 8 |
| n | Sample size without replacement | 10 |
| k | Selected sample defect count | 2 |
Waiting for valid inputs.
FIVE-STEP USE
FIVE FINITE-LOT FUNDAMENTALS
FORMULA AND DEFAULT SUBSTITUTION
For `N=100`, `D=8`, and `n=10`, the expected count is `10 x 8/100 = 0.8`. Summing masses through 2 gives 96.8612%; summing from 2 upward gives 18.1950%. The overlap at exactly 2 belongs to both inclusive tails.
THREE DEEPER MODULES
When the sample is tiny relative to the lot, a binomial approximation may be close. As the fraction grows, without-replacement dependence materially reduces variance.
`P(X<=k) + P(X>=k)` equals `1 + P(X=k)`, not one. This is a useful reconciliation and prevents treating overlapping tails as complements.
If D is not known, rerun plausible compositions. The distribution then shows conditional detection power rather than estimating the unknown lot defect count.
TWO SAMPLING CASES
From a 100-unit lot believed to contain 8 defectives, a 10-unit draw has a nontrivial chance of seeing none or one. The table makes the miss risk visible before a containment rule is approved.
With `n=N`, the sample defect count must equal D. Variance becomes zero and the outcome table collapses to one row with probability 100%.
FINITE-LOT GLOSSARY
LIMITS AND EVIDENCE
Retain: lot identity, N and D basis, randomization method, sample identifiers, inspection disposition, selected tail rule, and exported exact table.
RELIABLE SOURCES
DEFECT DISTRIBUTION FAQ
The finite lot is sampled without replacement, so each draw changes what remains. The hypergeometric model includes that dependence and finite-population correction.
It is the fixed defective count assumed to exist in the entire lot for this scenario. If it is unknown, the page is a what-if model, not an estimate.
A sample cannot contain more defects than the lot holds or more conforming units than the lot holds. The feasible support enforces both constraints.
`P(X>=k)` answers at least k defects; `P(X<=k)` answers at most k. The point probability answers exactly k and should not be confused with either tail.
The page prints every feasible exact outcome for review. The limit protects browser responsiveness and PDF readability while allowing large finite lots.
Not by itself. The result is conditional on simple random sampling and the assumed fixed lot composition; inspection errors and selection bias can dominate.
IMPORTANT SAMPLING NOTE
The probabilities are exact for the stated finite-lot model. A convenience sample from accessible cartons can still make the operational conclusion unreliable.