What does Blind Boxes, Hidden Variants and Odds Disclosure conclude, in numbers, about “Collecting under Unequal Odds: Inclusion–Exclusion, a Poissonisation Integral and Tilted Designs”?

Answer: Chapter 3 handles unequal odds by inclusion-exclusion and a Poissonisation integral: 12 regulars plus a 1/144 hidden variant take 149.07 boxes.

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: 12, 144, 149.07

rates: hidden 1/144, each regular 143/17281/12.084
E[boxes] for the 12 regulars only37.4989
(12 * H_1237.2385 scaled by 144/143 = 37.4989)
E[boxes] for all 13 incl. hidden149.0732
E[wait for hidden alone]144.0000
extra over the hidden alone5.0732
hidden rate E[regular set] E[full set] full/hidden-alone
1/2438.86 44.50 1.8540
1/4838.03 60.77 1.2661
1/7237.76 81.26 1.1287
1/14437.50 149.07 1.0352
1/28837.37 290.66 1.0092
Show the full program
# Chapter 3. p31: unequal probabilities by inclusion-exclusion.
# For designs with probabilities p_1..p_m (summing to 1) the expected
# number of boxes to see every design is
#   E[T] = sum over nonempty S of (-1)^(|S|+1) / P(S),
# with P(S) the total probability of the designs in S (Flajolet, Gardy
# and Thimonier 1992). Exact with Fractions; subsets are grouped by
# how many regular designs they contain, so 13 designs need 26 terms.
# Series: 12 regulars sharing 143/144, one hidden at 1/144 (illustrative).
import math
from fractions import Fraction

H = Fraction(1, 144)
R = (1 - H) / 12


def expected(n_reg, r, hidden):
    total = Fraction(0)
    for j in range(n_reg + 1):
        for h in (0, 1) if hidden else (0,):
            size = j + h
            if size == 0:
                continue
            ps = j * r + (h * hidden if h else 0)
            term = Fraction(math.comb(n_reg, j)) / ps
            total += term if size % 2 == 1 else -term
    return total


e_reg = expected(12, R, None)
e_all = expected(12, R, H)
print("rates: hidden 1/144, each regular {} = 1/{:.3f}".format(
    R, float(1 / R)))
print("E[boxes] for the 12 regulars only: {:.4f}".format(float(e_reg)))
print("  (12 * H_12 = 37.2385 scaled by 144/143 = {:.4f})".format(
    37.2385 * 144 / 143))
print("E[boxes] for all 13 incl. hidden:  {:.4f}".format(float(e_all)))
print("E[wait for hidden alone]:          {:.4f}".format(float(1 / H)))
print("extra over the hidden alone:       {:.4f}".format(
    float(e_all - 1 / H)))
print()
print("hidden rate  E[regular set]  E[full set]  full/hidden-alone")
for n in (24, 48, 72, 144, 288):
    h = Fraction(1, n)
    r = (1 - h) / 12
    a = expected(12, r, None)
    b = expected(12, r, h)
    print("   1/{:<4d}     {:8.2f}      {:8.2f}      {:.4f}".format(
        n, float(a), float(b), float(b / n)))

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 3: Collecting under Unequal Odds: Inclusion–Exclusion, a Poissonisation Integral and Tilted Designs. 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