Hypergeometric CDF Calculator
The probability of k or fewer successes when drawing n items without replacement from a population of N containing K successes.
What this page computes
Sums the hypergeometric point probabilities from the bottom of the support up to k, so the answer is a without-replacement lower tail.
How to use it
Type the Population size N, Successes in population K, Draws n, Observed successes k and press Run. N ≥ 1 is the population, K the successes in it (0 ≤ K ≤ N), n the draws (0 ≤ n ≤ N) and k the observed successes, on the same support as the PMF. With N = 50, K = 5, n = 10, at most 2 successes, the page prints P(X ≤ 2) = 0.95174.
Running it
The CDF is the sum of the PMF over the support up to k. Each term is evaluated in logarithms; the sum is taken in increasing order so no term dominates the rounding. Every figure is computed in this browser tab: nothing is uploaded and nothing is stored.
Sums the hypergeometric point probabilities from the bottom of the support up to k, so the answer is a without-replacement lower tail. With N = 50, K = 5, n = 10, at most 2 successes, the page prints P(X ≤ 2) = 0.95174.
The CDF is the sum of the PMF over the support up to k. Each term is evaluated in logarithms; the sum is taken in increasing order so no term dominates the rounding. The printed result is accurate to log-gamma arithmetic, about 1e-14 relative for ordinary inputs; no table is read and nothing is simulated.
How to use this hypergeometric distribution calculator
Type each value below and press Run. The page prints the lower-tail probability and the parameter line it used, so the answer can be checked against the formula rather than taken on trust.
The inputs this page reads are Population size N (whole number, at least 1); Successes in population K (whole number, 0 to N); Draws n (whole number, 0 to N); Observed successes k (whole number on the support).
The parameterisation
N ≥ 1 is the population, K the successes in it (0 ≤ K ≤ N), n the draws (0 ≤ n ≤ N) and k the observed successes, on the same support as the PMF.
The numeric method
The CDF is the sum of the PMF over the support up to k. Each term is evaluated in logarithms; the sum is taken in increasing order so no term dominates the rounding.
The printed value is accurate to log-gamma arithmetic, about 1e-14 relative for ordinary inputs. The page returns the lower-tail probability only; it does not also print a test statistic, a p-value or a decision.
What to Expect
Best for
- a without-replacement tail probability
- acceptance sampling with a finite lot
Not ideal for
- a single exact count, which is the PMF page
- with-replacement draws
What this tool keeps
- Double-precision arithmetic in your own browser
- The same inputs always produce the same output
Common errors
- Every count must be a whole number inside its range, and k must lie on the support.
Example use cases
- lot acceptance decisions
- teaching finite-population corrections
Sample input
N = 50, K = 5, n = 10, at most 2 successes.
Sample output
P(X ≤ 2) = 0.95174.
Who this is for
- students
- quality engineers
Frequently asked questions
Which parameterisation does this page use?
N ≥ 1 is the population, K the successes in it (0 ≤ K ≤ N), n the draws (0 ≤ n ≤ N) and k the observed successes, on the same support as the PMF.
How is the result computed?
The CDF is the sum of the PMF over the support up to k. Each term is evaluated in logarithms; the sum is taken in increasing order so no term dominates the rounding. The result is accurate to log-gamma arithmetic, about 1e-14 relative for ordinary inputs.
What inputs are refused?
Every count must be a whole number inside its range, and k must lie on the support.
Is anything uploaded?
No. Every number is computed by JavaScript in this page from the values you typed; nothing is posted, stored or logged.
Build custom tools for your store
Join the SDK program to create useful ecommerce utilities for your store.