What does Blind Boxes, Hidden Variants and Odds Disclosure conclude, in numbers, about “Classical Sources East and West: Guanpu in the Dongjing Meng Hua Lu and de Moivre's De Mensura Sortis”?
Answer: The Dongjing Meng Hua Lu records that Kaifeng "released guanpu for three days" at festivals, that coins were thrown into earthenware basins, that some staked "one hu for thirty", and that prices were agreed beforehand, but it records no rule for winning; if the rule was five coins on a named face, odds of one to thirty left the stall 0.0312 of each stake. De Mensura Sortis wrote games of chance as numbered problems of calculation, and later literature traces an early form of the collector's problem to it, though this book could not verify the specific problem number. A six-sided die needs 13 throws before all faces are more likely than not, and a twelve-sided die thrown 24 times shows every face with the same probability as 24 boxes completing 12 designs, 0.1502. The institutions and the calculations of the past are in place. What remains is the question of how a shop today can turn them into a disclosure page that can be listed, checked and refuted. Chapter 8 closes the loop.
Scope of the numbers: Its parameters are illustrative; all calculations are generated by its programs; it is general information, not individualised legal or financial advice, and every statute must be checked by a person before listing. Chapter 5 computes a lucky bag's mean, spread and chance of being worth less than its price (0.8280 for the illustrative bag) and the weighting of small chances.
Data table
The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 0.1502, 12, 13, 24
| die with 6 faces: | |
| k | 6: P = 0.0154, odds for = 0.016 to 1 |
| k | 10: P = 0.2718, odds for = 0.373 to 1 |
| k | 13: P = 0.5139, odds for = 1.057 to 1 |
| k | 14: P = 0.5828, odds for = 1.397 to 1 |
| k | 20: P = 0.8480, odds for = 5.578 to 1 |
| least k for even odds | 13; mean throws f H_f = 14.70 |
| die with 12 faces: | |
| k | 12: P = 0.0001, odds for = 0.000 to 1 |
| k | 24: P = 0.1502, odds for = 0.177 to 1 |
| k | 35: P = 0.5318, odds for = 1.136 to 1 |
| k | 36: P = 0.5630, odds for = 1.288 to 1 |
| least k for even odds | 35; mean throws f H_f = 37.24 |
| six throws show all six faces | 5/324 = 0.0154 |
Show the full program
# 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)))Single source and citation
Fan, Y. (2026). Blind-Box Coupon Collecting, Geometric Waits for Hidden Variants and Odds Disclosure for Lucky Bags (Version 1.0.0), Chapter 7: Classical Sources East and West: Guanpu in the Dongjing Meng Hua Lu and de Moivre's De Mensura Sortis. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 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}
}Other chapter answers in this book
- Chapter 1 · How Many Boxes for Twelve Designs: Harmonic Numbers, Variance and the Full Distribution
- Chapter 2 · The Hidden Variant at 1/144: Geometric Waits, Quantiles and Guarantees
- Chapter 3 · Collecting under Unequal Odds: Inclusion–Exclusion, a Poissonisation Integral and Tilted Designs
- Chapter 4 · Duplicates, Pooling and Buying the Gaps: the Double Dixie Cup and When to Stop Opening
- Chapter 5 · Expected Value and Spread of a Lucky Bag: Tiers, Convolution and the Weighting of Small Chances
- Chapter 6 · The Seller's Design Choices: Case Packing, Set-Completion Prizes and Two Allocation Rules
- Chapter 8 · Closing the Loop: an Odds-Disclosure Generator for Lucky-Bag Pages, a Taiwan and Malaysia Checklist and a Pre-Registered Audit