Exam PDiscreteFree to read

Negative binomial distribution

The number of failures before the rth success in repeated independent trials.

Parameters and support

number of successes being waited for
probability of success on one trial
Support

The formulas

p(x)
F(x)

I is the regularized incomplete beta function; no elementary closed form exists.

Mean
Variance
MGF
Memory hook. It is r independent geometrics stacked, so everything is r times the geometric's: mean r(1−p)/p, variance r(1−p)/p². Unlike the binomial, its variance is LARGER than its mean.

Where the moments come from

  1. The last trial must be the th success, so the first trials contain exactly failures: arrangements.
  2. Each arrangement has probability .
  3. Write with independent geometrics .
  4. and, by independence, .
  5. The MGF is the geometric MGF raised to the th power.

Worked example

Each policy application is independently approved with probability 0.6. Find the probability that the third approval occurs on the sixth application.

  1. The sixth application being the third approval means 3 failures precede the 3rd success, so with .
  2. .
  3. , , .
  4. .

Answer: 0.13824

The mean, variance, CDF and moment generating function above are re-derived numerically from this distribution’s own density on every test run — summed over the support for a discrete distribution, integrated by quadrature for a continuous one — and compared with the closed forms printed here. A typo on this page fails the build.

Traps

  • Using the binomial coefficient C(x + r, x) instead of C(x + r − 1, x) — the last trial is pinned as a success and is not free to move.
  • Counting trials instead of failures, which shifts the mean by r.

Related

Drill this: the Exam P question bank has original questions on this distribution, and the recall trainer builds its prompts from exactly the formulas above.