Thread: Neg Binomial and Binomial algebra relationship

Hi could anyone give me a bit of help on this, i know it is probably simple but i am a bit unsure:

Find an algebraic relationship between the negative binomial probability P(x) and the binomial probability for the probability of n successes in x trials.

The real relationship is between the geometric and the Neg Bi.
The rv in the geo is the trial in which the first success appears.
The rv in the neg bi is the trial in which the success appears.
So, if r=1, the neg bi becomes the geo.
And the geo is a sum of r i.i.d. geo's.
Both of these rvs have infinite support.
BUT with the Binomial there is a fixed number of trials.
In the other two we can keep waiting for Godot, which may never happen.
I work with the St petersburg game and thats an example where we wait a long time for a big pay out.
It has infinite expectation, which confused the Bernoulli's 295 years ago.
BUT my solution to that game does work.

Hi thanks for your reply, i think the question however is what is the algebraic relationship between:

Binomial

n! multiplied by p^x (1-p)^n-x
x!(n-x)!

Negative Binomial

(x-1)! multiplied by p^n (1-p)^x-n
(n-1)!(x-n)!

How would I explain this??

Both of these distributions are based on repeat independent trials where there are two possible outcomes. The probability of 'success' is p and the probability of 'failure' is q=1-p. You can switch the success and failure when answering these questions.
Now with the binomial, you have a fixed number of trials, n.
The is how many ways you can place x successes and (n-x) failures in those n trials.
The negative binommial is the same in regards to success and failures.
BUT here we are waiting for the success
USING your notation, since you have
You have

since that last success appears in the trial
So we have p-1 more successes to place within the previous x-1 trials.
But there are still n successes, hence the , which represents n successes all with probability p.
Likewise we have x-n failures all with probability 1-p.