CombinatoricsDifficulty 5.9AIME, harderProve itUnited States
Problem:
Max repeatedly throws a fair coin in a hurricane. For each throw, there is a 4% chance that the coin gets blown away. He records the number of heads H and the number of tails T before the coin is lost. (If the coin is blown away on a toss, no result is recorded for that toss.) What is the expected value of ∣H−T∣?
Solutions — 3
Solution 1
Solution:
In all solutions, p=251 will denote the probability that the coin is blown away. Let D=∣H−T∣. Note that if D=0, the expected value of D is not changed by a coin flip, whereas if D=0, the expected value of D increases by 1. Therefore E(D) can be computed as the sum over all n of the probability that the nth coin flip occurs when D=0. This only occurs when n=2k+1 is odd, where the probability that the first n coin flips occur is (1−p)2k+1 and the probability that D=0 after the first n−1 flips is 4k(k2k). Therefore E(D)=(1−p)k=0∑∞(21−p)2k(k2k)=1−(1−p)21−p using the generating function k=0∑∞(k2k)xk=1−4x1 Plugging in p=251 yields E(D)=724.
Solution 2
Solution:
For each n⩾0, the probability that Max made n successful throws (not counting the last throw) is p(1−p)n.
Claim: Assuming Max made n⩾1 throws, the expected value of ∣H−T∣ is given by k=1∏⌊(n−1)/2⌋2k2k+1.
Proof. If n is odd then the expected value for n+1 will be equal to that for n; since ∣H−T∣ will be nonzero, it will be equally likely to increase or decrease after the coin is flipped. Therefore, it suffices to compute the expected value for the n odd case. This is 2n−1∑i=0(n−1)/2(in)⋅(n−2i)=n−2n−1∑i=0(n−1)/2(in)⋅2i=n⋅(1−2n−12⋅∑i=0(n−3)/2(in−1))=n⋅2n−1((n−1)/2n−1) =(n−1)!!2n!=(n−1)!!n!!=k=1∏(n−1)/22k2k+1 as desired.
Using the claim, we have E(∣H−T∣)=pn=1∑∞(1−p)nk=1∏⌊(n−1)/2⌋2k2k+1=p(1−p)(2−p)m=0∑∞((1−p)2mk=1∏m2k2k+1)=p(1−p)(2−p)(1−(1−p)2)−3/2=p(2−p)1−p. Plugging in p=251 gives E(∣H−T∣)=2524⋅5⋅75=724.
Solution 3
Solution:
Let En be the expected value of ∣H−T+n∣. By symmetry, E−n=En for all n. Considering what happens in the next throw gives 2En=(1−p)En−1+(1−p)En+1+2pn for all n⩾0. Now let α=1−p1−p(2−p)<1 be the smaller root of (1−p)x2−2x+(1−p)=0. From n=1∑∞2αnEn=n=1∑∞αn((1−p)En−1+(1−p)En+1+2pn)=α(1−p)E0+(2α−(1−p))E1+n=1∑∞2pnαn+n=2∑∞2αnEn we have (1−p)E1−α(1−p)E0=n=1∑∞2pnαn=(1−α)22pα As E0=(1−p)E1, this gives E0(1−α(1−p))=(1−α)22pα Plugging in p=251 and α=43 gives E0=724.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.
Source: MathNet,
licensed CC-BY-4.0.
Statement reproduced verbatim; metadata (topic, difficulty) added by this project.