Toss three fair coins at a time (first round of tosses). In the next round, you pick up only the coins that came up tails and toss them again. You repeat the procedure and count the rounds until there are no more tails to pick up.
The expected number of rounds of tosses before you stop can be expressed as , with coprime.
Find .
Examples of possible outcomes:
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
If at any point of the process we have three heads, the expected value of rounds of tosses at that point is E 3 = 0 since we have achieved the goal. E 3 is the "state" of having three heads.
If at any point we have two heads ( E 2 ) , we can write the following equation: E 2 = 1 + 2 1 E 3 + 2 1 E 2 ⟹ E 2 = 1 + 2 1 ⋅ 0 + 2 1 E 2 ⟹ E 2 = 2 .
Make sure you understand what this last equation means: we toss the coins once more ( 1 + … ) and we have a 50% chance of achieving the goal ( E 3 ) or a 50% chance of going back to where we started ( E 2 ) .
Note that in this case there is one way out of four of reaching the goal (H,H), two ways out of four of jumping to state E 2 , (H,T) and (T,H), and one way out of four of remaining in the same state E 1 , (T,T), hence the probabilities used.
A = 2 2 , B = 7 and A + B = 2 9
The title of the problem refers to the fraction 7 2 2 , which is the famous approximation of π used by Archimedes.