关于「东西方原典考辨:《东京梦华录》的关扑与 de Moivre 的《De Mensura Sortis》」,《盲盒收集与福袋概率公示》给出的定量结论是什么?

结论:《东京梦华录》记录了北宋开封在节日「放关扑三日」、以瓦盆掷头钱、「以一笏扑三十笏」以及「约以价而扑之」,却没有记录输赢规则;若规则是五枚钱全为指定一面,一比三十的赔率让摊主每份抽取 0.0312。《De Mensura Sortis》把机会游戏写成编号的计算问题,后世文献把收集问题的早期形式追溯到它,具体编号本书未能核实。六面骰掷 13 次才有过半的机会六面齐现,12 面骰掷 24 次全部出现的概率与 24 盒集齐 12 款相同,都是 0.1502。古人的制度与计算都已就位,剩下的问题是:一家今天的门店,怎样把它们变成一页可以上架、可以核对、可以被推翻的公示?第八章给出闭环。

数据口径:书中参数为示意;全部计算由书中程序生成;本书是非个人化法律或理财建议,法条以上架前人工复核为准。 第一章用调和数、精确分布与固定种子模拟算等概率集齐;第二章用几何分布算隐藏款等待,并陈复合事件判断偏差的相反证据,说明保底只改变等待(保底 144 次时平均 91.21 次)而不改变标称概率;第三章用容斥公式与泊松化积分算不等概率,12 款加 1/144 隐藏款的全套期望是 149.07 盒;第四章用双杯问题算合买与重复款,以及开盒止损;第五章算福袋的期望、方差与低于售价的概率(示意福袋为 0.8280)以及小概率加权。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.1502, 12, 13, 24

die with 6 faces:
k6: P = 0.0154, odds for = 0.016 to 1
k10: P = 0.2718, odds for = 0.373 to 1
k13: P = 0.5139, odds for = 1.057 to 1
k14: P = 0.5828, odds for = 1.397 to 1
k20: P = 0.8480, odds for = 5.578 to 1
least k for even odds13; mean throws f H_f = 14.70
die with 12 faces:
k12: P = 0.0001, odds for = 0.000 to 1
k24: P = 0.1502, odds for = 0.177 to 1
k35: P = 0.5318, odds for = 1.136 to 1
k36: P = 0.5630, odds for = 1.288 to 1
least k for even odds35; mean throws f H_f = 37.24
six throws show all six faces5/324 = 0.0154
查看完整验算程序
# Chapter 7. p72: the early form of the collector's question, recomputed.
# A die with f equally likely faces is thrown k times; the chance that
# every face shows at least once is, by inclusion-exclusion,
#   P(f, k) = sum_j (-1)^j C(f, j) (1 - j/f)^k,  j = 0 to f.
# Results are stated as odds "a to b", the format of the period, and
# the least k giving even odds or better is reported. f = 6 is the
# ordinary die; f = 12 is a twelve-design blind-box series.
import math
from fractions import Fraction


def p_all(f, k):
    total = Fraction(0)
    for j in range(f + 1):
        t = Fraction(math.comb(f, j)) * Fraction(f - j, f) ** k
        total += t if j % 2 == 0 else -t
    return total


def odds(p):
    return "{:.3f} to 1".format(float(p / (1 - p))) if p < 1 else "sure"


for f in (6, 12):
    print("die with {} faces:".format(f))
    for k in ((6, 10, 13, 14, 20) if f == 6 else (12, 24, 35, 36)):
        p = p_all(f, k)
        print("  k = {:2d}: P = {:.4f}, odds for = {}".format(
            k, float(p), odds(p)))
    k = f
    while p_all(f, k) < Fraction(1, 2):
        k += 1
    h = Fraction(0)
    for i in range(1, f + 1):
        h += Fraction(1, i)
    print("  least k for even odds: {}; mean throws f H_f = {:.2f}".format(
        k, float(f * h)))
p = p_all(6, 6)
print("six throws show all six faces: {} = {:.4f}".format(
    p, float(p)))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《盲盒收集券问题、隐藏款几何等待时间与福袋概率公示合规母典》第 7 章「东西方原典考辨:《东京梦华录》的关扑与 de Moivre 的《De Mensura Sortis》」(版本 1.0.0). 5D Library. DOI 待发布

DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-210 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026210,
  author    = {Fan, Yafu},
  title     = {Blind-Box Coupon Collecting, Geometric Waits for Hidden Variants and Odds Disclosure for Lucky Bags},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论