We present an analysis of a coin-tossing problem posed by Daniel Litt which has generated some popular interest. We demonstrate a recursive identity which leads to relatively simple formulas for the excess number of wins for one player over the other together with its increments as the number of coin tosses increases. Formulas and recursive algorithms are provided to calculate the number of sequences with any given point-score difference.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。