Problem 7.1 Easy Free

Conditioning on Past Coin Flips

A fair coin is flipped repeatedly, and HnH_n denotes the number of heads among the first nn flips. Compute P[H9=6∣H6=5]\mathbb{P}[H_9 = 6 \mid H_6 = 5].

Work it out, then compare with the answer.

SolutionShow the worked solution

Write H9=H6+(H9−H6)H_9 = H_6 + (H_9 - H_6), where H9−H6H_9 - H_6 counts the heads among flips 77, 88, 99. These three flips are independent of the first six, so H9−H6∼Bin(3,12)H_9 - H_6 \sim \mathrm{Bin}(3,\tfrac12) independently of H6H_6. Hence

P[H9=6∣H6=5]=P[H9−H6=1∣H6=5]=P[H9−H6=1]=(31)123=38.\mathbb{P}[H_9 = 6 \mid H_6 = 5] = \mathbb{P}[H_9 - H_6 = 1 \mid H_6 = 5] = \mathbb{P}[H_9 - H_6 = 1] = \binom{3}{1}\frac{1}{2^3} = \frac{3}{8}.
38\boxed{\tfrac{3}{8}}

Key idea. Increments over disjoint blocks of flips are independent, so conditioning on H6H_6 leaves a fresh Bin(3,12)\mathrm{Bin}(3,\tfrac12) count for the remaining flips.