Eclair_de_XII
- 1,082
- 91
So is it ##\frac{p}{q}(\frac{1-q^{s-1}}{p})=\frac{1-q^{s-1}}{q}##, then...?
The discussion focuses on calculating the probability of obtaining r consecutive heads before s consecutive tails in a series of coin tosses, denoted as P(E|H_1), P(E|T_1), and P(E). The participants clarify that the problem can be approached using conditional probabilities based on the outcome of the first toss. They derive equations that relate these probabilities, emphasizing the importance of conditioning on the first trial. The final equations involve matrix operations and highlight the use of renewal theory and Markov chains for deeper insights.
PREREQUISITESMathematicians, statisticians, and students studying probability theory, particularly those interested in stochastic processes and combinatorial probability problems.
Eclair_de_XII said:So is it ##\frac{p}{q}(\frac{1-q^{s-1}}{p})=\frac{1-q^{s-1}}{q}##, then...?
Eclair_de_XII said:This is how I'm getting it: ##\sum_{k=1}^{s-1} pq^{k-1}=\frac{p}{q}\sum_{k=1}^{s-1} q^{k}=\frac{p}{q}(\frac{1-q^{s-1}}{1-q})=\frac{p}{q}(\frac{1-q^{s-1}}{p})##.
Eclair_de_XII said:I don't know what you mean by telescoping process. Do you mean that the finite sum is a telescoping series?