What is the expected number of tosses such that there are 3 consecutive sixes.
In solving the above, this comment uses the recursion $E_{n+1}=6(E_n+1)$, justified by:
to see n+1 sixes we need to first see n sixes and then we need another 6
I understand this informally. But can we make it more formal? Here is my attempt:
- Let $n$ be the number of consecutive sixes in the current sequence. We begin at $n=0$
- From $n=k, k\geq1$, the system moves to $n=k+1$ with probability $\frac{1}{6}$, and moves to $n=0$ with probability $\frac{5}{6}$. In either case, the number of rolls required increases by 1.
- Using a geometric random variable, since $n$ moves from $k$ to $k+1$ with probability $\frac{1}{6}$, the expected number of iterations is 6.
The final number of expected iterations is: $$E_{n+1}=6(E_n+1)$$
Is this justification correct?