What does Blind Boxes, Hidden Variants and Odds Disclosure conclude, in numbers, about “How Many Boxes for Twelve Designs: Harmonic Numbers, Variance and the Full Distribution”?

Answer: For 12 equally likely designs, the expected number of boxes for a full set is 37.2385, with a standard deviation of 13.72, a median of 35 and a ninetieth percentile of 55. Of the expectation, 0.790 is spent on the last six designs. One hundred thousand seeded simulations agree with the formulas. These are mathematical facts; whether buyers generally underestimate them remains a hypothesis awaiting a survey. The next chapter asks a sharper question: with a hidden variant stated at 1/144, how sure can a buyer of 144 boxes be?

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.790, 12, 13.72, 37.2385

n12: E[T] = 12 * H_12 = 86021 / 2310
= 37.2385 boxes
sd13.72, ratio E[T]/n = 3.10
last design alone takes on average 12 boxes
n E[T] sd E[T]/n n ln n + g n + 1/2
614.70 6.24 2.45 14.71
821.74 8.72 2.72 21.75
1029.29 11.21 2.93 29.30
1237.24 13.72 3.10 37.25
1654.09 18.75 3.38 54.10
2490.62 28.87 3.78 90.63
mean wait for design 1, 6, 11, 121.00 1.71 6.00 12.00
share of E[T] spent on the last 6 designs0.790
Show the full program
# Chapter 1. p11: expected boxes and spread to complete n equal designs.
# Model: n regular designs, each box shows one design with probability
# 1/n, independently. The number of boxes T to see all n designs is a
# sum of geometric waits with means n/(n-k), k = 0 to n - 1, so
#   E[T] = n * H_n,   Var[T] = n^2 * H2_n - n * H_n,
# with H_n the sum of 1/k and H2_n the sum of 1/k^2 for k = 1 to n
# (Feller 1968; exact identities, no parameters to estimate). The last
# column is the asymptotic form with Euler's constant g = 0.5772.
# Series sizes 6 to 24 are illustrative; 12 is the common shelf size.
import math
from fractions import Fraction


def harmonic(n):
    return sum_fr(Fraction(1, k) for k in range(1, n + 1))


def sum_fr(xs):
    total = Fraction(0)
    for x in xs:
        total += x
    return total


def moments(n):
    h1 = math.fsum(1.0 / k for k in range(1, n + 1))
    h2 = math.fsum(1.0 / (k * k) for k in range(1, n + 1))
    mean = n * h1
    var = n * n * h2 - n * h1
    return mean, math.sqrt(var)


e12 = 12 * harmonic(12)
print("n = 12: E[T] = 12 * H_12 = {} / {}".format(
    e12.numerator, e12.denominator))
print("        = {:.4f} boxes".format(float(e12)))
m12, s12 = moments(12)
print("        sd = {:.2f}, ratio E[T]/n = {:.2f}".format(s12, m12 / 12))
print("last design alone takes on average {} boxes".format(12))
print()
print(" n    E[T]     sd    E[T]/n   n ln n + g n + 1/2")
for n in (6, 8, 10, 12, 16, 24):
    m, s = moments(n)
    approx = n * math.log(n) + 0.5772156649 * n + 0.5
    print("{:2d}  {:7.2f}  {:5.2f}  {:6.2f}   {:7.2f}".format(
        n, m, s, m / n, approx))
print()
waits = [12.0 / (12 - k) for k in range(12)]
print("mean wait for design 1, 6, 11, 12: {:.2f} {:.2f} {:.2f} {:.2f}"
      .format(waits[0], waits[5], waits[10], waits[11]))
half = math.fsum(waits[6:])
print("share of E[T] spent on the last 6 designs: {:.3f}".format(
    half / m12))

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 1: How Many Boxes for Twelve Designs: Harmonic Numbers, Variance and the Full Distribution. 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