关于「隐藏款 1/144:几何等待、分位数与保底机制」,《盲盒收集与福袋概率公示》给出的定量结论是什么?
结论:第二章用几何分布算隐藏款等待,并陈复合事件判断偏差的相反证据,说明保底只改变等待(保底 144 次时平均 91.21 次)而不改变标称概率;
数据口径:书中参数为示意;全部计算由书中程序生成;本书是非个人化法律或理财建议,法条以上架前人工复核为准。 第一章用调和数、精确分布与固定种子模拟算等概率集齐;第二章用几何分布算隐藏款等待,并陈复合事件判断偏差的相反证据,说明保底只改变等待(保底 144 次时平均 91.21 次)而不改变标称概率;第三章用容斥公式与泊松化积分算不等概率,12 款加 1/144 隐藏款的全套期望是 149.07 盒;第四章用双杯问题算合买与重复款,以及开盒止损;第五章算福袋的期望、方差与低于售价的概率(示意福袋为 0.8280)以及小概率加权。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 144, 91.21
| G E[wait] effective rate P(delivered by guarantee) | |
| 60 | 49.21 1/49.21 0.6629 |
| 100 | 72.27 1/72.27 0.5016 |
| 144 | 91.21 1/91.21 0.3692 |
| 200 | 108.27 1/108.27 0.2499 |
| 288 | 124.65 1/124.65 0.1353 |
| 500 | 139.58 1/139.58 0.0309 |
| no guarantee: E[wait] | 144 |
| G | 144: mean 91.21, sd 51.52, total prob 1.000000 |
| E[wait] < G always, so an effective 1/144 needs G > 144; | |
| base rate p that makes E[wait] | 144 under guarantee G: |
| G | 200: p = 1/285.7 |
| G | 288: p = 1/180.4 |
| G | 500: p = 1/149.2 |
查看完整验算程序
# Chapter 2. p23: a guarantee ("pity") changes the wait, not the rate.
# Model: base rate p = 1/144 per box; under a hard guarantee of G boxes
# the G-th box after the last hit is a hit for sure. Then
# E[wait] = (1 - (1 - p)^G) / p
# effective rate = 1 / E[wait]
# P(guarantee is what delivers) = (1 - p)^(G - 1).
# G values are illustrative design choices, not any shop's policy.
import math
from fractions import Fraction
p = Fraction(1, 144)
def mean_wait(g):
return (1 - (1 - p) ** g) / p
print(" G E[wait] effective rate P(delivered by guarantee)")
for g in (60, 100, 144, 200, 288, 500):
m = mean_wait(g)
print("{:4d} {:7.2f} 1/{:<7.2f} {:.4f}".format(
g, float(m), float(m), float((1 - p) ** (g - 1))))
print(" no guarantee: E[wait] = {}".format(int(1 / p)))
print()
g = 144
dist = [float((1 - p) ** (k - 1) * p) for k in range(1, g)]
dist.append(float((1 - p) ** (g - 1)))
mean = math.fsum((k + 1) * x for k, x in enumerate(dist))
sd = math.sqrt(math.fsum((k + 1 - mean) ** 2 * x
for k, x in enumerate(dist)))
print("G = 144: mean {:.2f}, sd {:.2f}, total prob {:.6f}".format(
mean, sd, math.fsum(dist)))
print("E[wait] < G always, so an effective 1/144 needs G > 144;")
print("base rate p that makes E[wait] = 144 under guarantee G:")
for g in (200, 288, 500):
lo, hi = 1e-9, 1.0 / 144
for _ in range(80):
mid = (lo + hi) / 2
if (1 - (1 - mid) ** g) / mid > 144:
lo = mid
else:
hi = mid
print(" G = {:3d}: p = 1/{:.1f}".format(g, 1 / lo))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《盲盒收集券问题、隐藏款几何等待时间与福袋概率公示合规母典》第 2 章「隐藏款 1/144:几何等待、分位数与保底机制」(版本 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}
}