A standard geometric distribution can be interpreted as the number of Bernoulli trials required to get one success. However, what if the probability of success if each trial diminishes by some factor with each failure?
Let $p$ be probability of success of the first trial and $d$ be the diminishing factor of each failure such that the probability of success of trial $n$ is $pd^{n-1}$. I have been trying to calculate the expected value of this distribution without success. My main stumbling block is the probability of failing $n$ times:
$$ P(n\text{ failures}) = \prod_{k=1}^n (1-pd^{k-1}) $$
Given that, the expected value would be
$$ E(X)=\sum_{n=1}^{\infty} npd^{n-1}F(n-1) $$
Is there a way to get a closed form for this?
I also suspect that there may be something screwy going on with the variance of this distribution. Since the probability of success tends to 0 exponentially, empirical trials either finish very quickly or rocket off to infinity as the probabilities become infinitesimal.
The random variable $X$ is not well-defined. For any $d\lt 1$, there is a non-zero probability that there will never be a success.
To show this, first note that it is clear that for any $n$, there is a non-zero probability that the game will last at least $n$ trials. We can choose $n$ large enough that $pd^{n-1}$ is as small as we wish. Given that there have been $n$ trials without a success, the probability that there will never be a success is $\prod_{k=n+1}^\infty(1-pd^{k-1})$. For small $pd^{k-1}$, we can lower bound the logarithm of this. For example, it is $\gt -\sum_{n+1}^\infty 2pd^{k-1}$.