Negative Binomial CDF Calculator
The probability of k or fewer failures before the r-th success, with success probability p.
What this page computes
Evaluates P(X ≤ k) through the regularized incomplete beta I_p(r, k + 1), the closed form of the negative-binomial sum.
How to use it
Type the Required successes r, Success probability p, Failures allowed k and press Run. r ≥ 1 is the required number of successes, 0 < p < 1 the success probability, and k ≥ 0 counts failures. The CDF reaches 1 as k grows. With r = 5, p = 0.5, at most 3 failures, the page prints P(X ≤ 3) = 0.363281.
Running it
The regularized incomplete beta I_p(r, k + 1), which equals the sum of the PMF from 0 to k. It is evaluated by the Lentz continued fraction, not by summing thousands of terms. Every figure is computed in this browser tab: nothing is uploaded and nothing is stored.
Evaluates P(X ≤ k) through the regularized incomplete beta I_p(r, k + 1), the closed form of the negative-binomial sum. With r = 5, p = 0.5, at most 3 failures, the page prints P(X ≤ 3) = 0.363281.
The regularized incomplete beta I_p(r, k + 1), which equals the sum of the PMF from 0 to k. It is evaluated by the Lentz continued fraction, not by summing thousands of terms. The printed result is accurate to about 1e-14 absolute for ordinary inputs; no table is read and nothing is simulated.
How to use this negative binomial 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 Required successes r (whole number, at least 1); Success probability p (strictly between 0 and 1); Failures allowed k (whole number, at least 0).
The parameterisation
r ≥ 1 is the required number of successes, 0 < p < 1 the success probability, and k ≥ 0 counts failures. The CDF reaches 1 as k grows.
The numeric method
The regularized incomplete beta I_p(r, k + 1), which equals the sum of the PMF from 0 to k. It is evaluated by the Lentz continued fraction, not by summing thousands of terms.
The printed value is accurate to about 1e-14 absolute 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 negative-binomial tail probability
- a quota run finishing within a failure budget
Not ideal for
- one exact count, which is the PMF page
- a fixed number of trials
What this tool keeps
- Double-precision arithmetic in your own browser
- The same inputs always produce the same output
Common errors
- r must be a whole number of at least 1, p strictly between 0 and 1, and k a whole number of at least 0.
Example use cases
- failure-budget planning
- over-dispersed count tails
Sample input
r = 5, p = 0.5, at most 3 failures.
Sample output
P(X ≤ 3) = 0.363281.
Who this is for
- students
- actuarial analysts
Frequently asked questions
Which parameterisation does this page use?
r ≥ 1 is the required number of successes, 0 < p < 1 the success probability, and k ≥ 0 counts failures. The CDF reaches 1 as k grows.
How is the result computed?
The regularized incomplete beta I_p(r, k + 1), which equals the sum of the PMF from 0 to k. It is evaluated by the Lentz continued fraction, not by summing thousands of terms. The result is accurate to about 1e-14 absolute for ordinary inputs.
What inputs are refused?
r must be a whole number of at least 1, p strictly between 0 and 1, and k a whole number of at least 0.
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.