硬币配对 V
Coin Pair V
题目详情
你先抛 4 枚公平硬币并观察结果(注意:这次初始抛掷不计入动作次数)。
之后每一步你要选定任意两枚硬币:
- 其中一枚你可以直接翻面(正变反、反变正),
- 另一枚必须“再抛一次”(随机变正/反)。
即每步会发生 2 次硬币动作(一次翻面、一次重掷)。即使你已经有 3 个正面,也必须继续执行上述两动作。
你会一直做下去直到 4 枚全为正面为止。问:所需硬币动作次数的期望是多少?
You flip fair coins and observe the outcomes. After seeing the outcomes, you select any pair of coins to reconsider. From the pair, one coin can be turned over while the other must be flipped again. If you already have heads, you still must perform both actions. You iterate this process until you end up with all coins being heads. A movement of a coin is when you either turn over or flip it. Find the expected number of coin movements needed to obtain heads.
Note: the initial flip of the coins doesn't count to coin movements.
解析
设 为当前有 个正面时,到达 4 个正面还需要的期望动作次数(每次操作算 2 个动作)。
。
- :选 1 个反面 + 1 个正面。翻反面使其变正,重掷另一枚正面:以 回到 3 个正面,以 到 4 个正面。
- :选两枚反面。翻其中一枚变正,重掷另一枚反面:以 到 4 个正面、以 到 3 个正面。
- :选两枚反面。翻一枚变正,重掷另一枚:以 到 3 个正面、以 到 2 个正面。
- :选两枚反面。翻一枚变正,重掷另一枚:以 到 2 个正面、以 到 1 个正面。
初始正面数 ,因此期望动作数为
Original Explanation
Let be the total number of coin flips needed and be the total number of heads that appear on the first flipping of the coins. Then by Law of Total Expectation. because counts the number of heads appearing in flips of a fair coin. To set our notation, let represent the additional number of flips needed to stop our process once we have heads.
If , then we get 4 heads, so . This would mean .
If , then we would consider one heads and one tails. We should turn over the tails so that we have a guaranteed head, i.e., we end up with either or heads after this process. Then, with equal probability, we would get a heads or tails on the remaining coin, so . Putting in yields . This means .
If , then we are considering tails, meaning we turn one over and flip the other. This is exactly the same scenario as above as we are guaranteed to have or heads after with the same probabilities, so as well. This means .
If , then we consider tails. We turn one over, and then we flip the other. We will end with either or heads after this iteration with equal probability. Therefore, . As , . This means .
Lastly, if , we just consider tails again. We turn one over, and then we flip the other. We will end with either or heads after this iteration with equal probability, so . Plugging in and yields , so .
Finally, we can plug the values and the PMF of into our expression from the beginning, we get that .