Negative Binomial RV
Let X be a discrete RV with range X={k,k+1,āÆ}, for kā„1. The number of Bernoulli trials needed for k successes is called a negative RV with parameters (k,p) and pmf p(n)=(kā1nā1ā)pk(1āp)nākFor RV Xā¼NB(k,p) E[X]\mboxVar(X)ā=pkā=p2k(1āp)āā ## The number of Bernoulli trials X needed for k successes