证明在n次抛硬币序列中HT比HH更可能多于反之
A proof that HT is more likely to outnumber HH than vice versa in a sequence of n coin flips
AI总结:
本文证明在n次公平抛硬币序列中,HT出现次数多于HH的概率更大,并给出获胜概率差的渐近形式及高效计算方法。
摘要:
考虑以下概率谜题:一枚公平硬币被抛掷n次。对于结果序列中的每个HT,Bob得一分,对于每个HH,Alice得一分。谁更可能获胜?我们提供了一个证明,表明对于每个n≥3,Bob更常获胜。作为副产品,我们推导了获胜概率差异的渐近形式,并获得了计算它们的有效算法。
英文摘要:
Consider the following probability puzzle: A fair coin is flipped n times. For each HT in the resulting sequence, Bob gets a point, and for each HH Alice gets a point. Who is more likely to win? We provide a proof that Bob wins more often for every n>=3. As a byproduct, we derive the asymptotic form of the difference in win probabilities, and obtain an efficient algorithms for their calculation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。