I have posted this already in other forums. Apologies for cross posting.
In order to establish some properties of inverse sampling, Haldane (1945) uses power series and the binomial theorem I assume. According to the inverse-sampling method (Haldane 1945) you continue sampling until m of the rare items have been found.
Let p be the frequency of the rare item and q = 1-p. m is the number of rare items observed. n is the number of observations
you continue sampling until m of the rare items have been found.
Let p be the frequency of the rare item and q = 1-p. m is the number of rare items observed. n is the number of observations
What is now the probability that exactly n observations have been made before m rare items are observed? According to Haldane (1945) this probability is
$w_{n} = \binom{n-1}{m-1}p^{m}q^{n-m}$
Haldane then concludes that "this is the coefficient of $t^n$ in $(\dfrac{qt}{1-qt})^m$ " (Haldane 1945: 222)
He does not go more into detail here and just continues with his proof on inverse sampling. However, I just do not see how this coefficient of $t^n$ is related to the probability $w_{n}$.
Assuming a geometric series, I could write
$\dfrac{qt^m}{(1-qt)} = \sum_{i=0} qt^mqt^i$
Furthermore, through differentiation of the power series, we get:
$\dfrac{qt^m}{(1-qt)^m} = \sum_{i=0} \binom{m+i+1}{i}qt^mqt^i$
Here, I get stuck. What is implied? Does the coefficient of $t^n$ simply refer to $\binom{m+i+1}{i}qt^mqt^i$? If so, however, how does it link up with $w_{n} = \binom{n-1}{m-1}p^{m}q^{n-m}$? Thanks for any hints/ helps!
It's convenient to use the coefficient of operator $[t^n]$ to denote the coefficient of $t^n$ in a series. We can write this way \begin{align*} [t^n](1+t)^m=\binom{m}{n} \end{align*}
Comment:
In (1) we use the linearity of the coefficient of operator and the rule $$[t^{n-m}]A(t)=[t^n]t^mA(t)$$
We obtain for $0\leq m\leq n$ \begin{align*} [t^{n-m}]A(t)&=[t^{n-m}]\sum_{k=0}^{\infty}a_kt^k=a_{n-m}\\ [t^n]t^mA(t)&=[t^n]t^m\sum_{k=0}^{\infty}a_kt^k =[t^n]\sum_{k=0}^{\infty}a_kt^{k+m} =a_{n-m} \end{align*} We also apply the binomial series expansion.
In (2) we use the binomial identity \begin{align*} \binom{-m}{k}=\binom{m+k-1}{m-1}(-1)^k \end{align*}
In (3) we select the coefficient of $t^{n-m}$ and take the summand with $k=n-m$.