What does The Name-Number, Digit-Field and Brand-Naming Codex conclude, in numbers, about “The Eighty-One Numbers, Part One: 1 to 40”?
Answer: Chapters 2 and 3 read the eighty-one numbers: between 2 and 39 a one-stroke error flips the grade with mean chance 0.684, and three-character totals never pass 62, so 41 to 81 is brand territory, holding 71.64% of four-character strings.
Scope of the numbers: It is not legal, investment or other professional advice.
Data table
The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. printed values that match the answer: 39, 62, 81
| three-character names: 2536800 | two-character names: 16912 | ||||
| percent of three-character names whose grid equals n | |||||
| n | tian | ren | di | wai | zong |
| 1 | 0.00 | 0.00 | 0.00 | 0.00 | 0.00 |
| 2 | 0.00 | 0.00 | 0.00 | 0.00 | 0.00 |
| 3 | 0.89 | 0.00 | 0.00 | 0.00 | 0.00 |
| 4 | 0.89 | 0.00 | 0.00 | 0.66 | 0.00 |
| 5 | 4.46 | 0.01 | 0.00 | 4.64 | 0.00 |
| 6 | 4.46 | 0.05 | 0.00 | 3.97 | 0.00 |
| 7 | 2.68 | 0.11 | 0.06 | 2.65 | 0.00 |
| 8 | 7.14 | 0.30 | 0.24 | 4.64 | 0.00 |
| 9 | 7.14 | 0.47 | 0.41 | 11.26 | 0.00 |
| 10 | 6.25 | 0.61 | 0.44 | 8.61 | 0.00 |
| 11 | 8.93 | 0.99 | 0.79 | 11.26 | 0.01 |
| 12 | 6.25 | 1.61 | 1.59 | 9.93 | 0.02 |
| 13 | 8.04 | 2.02 | 2.10 | 12.58 | 0.04 |
| 14 | 6.25 | 2.61 | 2.66 | 2.65 | 0.07 |
| 15 | 3.57 | 3.31 | 3.51 | 8.61 | 0.12 |
| 16 | 7.14 | 4.01 | 4.61 | 4.64 | 0.21 |
| 17 | 7.14 | 4.40 | 4.90 | 4.64 | 0.32 |
| 18 | 5.36 | 4.94 | 5.92 | 3.31 | 0.47 |
| 19 | 2.68 | 5.58 | 6.70 | 1.99 | 0.67 |
| 20 | 5.36 | 5.88 | 7.33 | 0.66 | 0.93 |
| 21 | 2.68 | 5.98 | 6.79 | 3.31 | 1.22 |
| 22 | 0.89 | 5.99 | 7.33 | 0.00 | 1.57 |
| 23 | 1.79 | 5.92 | 6.53 | 0.00 | 1.98 |
| 24 | 0.00 | 6.14 | 6.62 | 0.00 | 2.42 |
| 25 | 0.00 | 5.59 | 5.48 | 0.00 | 2.85 |
Show the full program
# Chapter 2. p21: How often each number 1-40 lands in each grid, over the engine's own character pool.
# Data: stroke counts (Kangxi convention, radicals restored) of the 112 single-character surnames and the
# 151 given-name characters in the station's kangxi.py, written here as {strokes: how many characters}.
# Population: every surname with every ordered pair of two different given-name characters
# (112 x 151 x 150 three-character names), plus every surname with one given character (two-character names).
# All names weigh the same; this is a base rate for the engine's pool, not for a census of real names.
SUR = {2: 1, 3: 1, 4: 5, 5: 5, 6: 3, 7: 8, 8: 8, 9: 7, 10: 10, 11: 7, 12: 9, 13: 7, 14: 4, 15: 8,
16: 8, 17: 6, 18: 3, 19: 6, 20: 3, 21: 1, 22: 2}
GIV = {3: 1, 4: 7, 5: 6, 6: 4, 7: 7, 8: 17, 9: 13, 10: 17, 11: 15, 12: 19, 13: 4, 14: 13, 15: 7, 16: 7, 17: 5,
18: 3, 19: 1, 20: 5}
JI = {1, 3, 5, 6, 7, 8, 11, 13, 15, 16, 17, 18, 21, 23, 24, 25, 29, 31, 32, 33, 35, 37, 39, 41,
45, 47, 48, 52, 57, 61, 63, 65, 67, 68, 81}
GRIDS = ("tian", "ren", "di", "wai", "zong")
def grids(sur, giv):
tian = sur[0] + 1 if len(sur) == 1 else sur[0] + sur[1]
ren = sur[-1] + giv[0]
di = giv[0] + 1 if len(giv) == 1 else sum(giv)
zong = sum(sur) + sum(giv)
return {"tian": tian, "ren": ren, "di": di, "wai": tian + di - ren, "zong": zong}
def tally(two_given):
cnt = {g: {} for g in GRIDS}
total = 0
for s, ws in SUR.items():
if two_given:
pairs = [((a, b), wa * (wb - (a == b))) for a, wa in GIV.items() for b, wb in GIV.items()]
else:
pairs = [((a,), wa) for a, wa in GIV.items()]
for giv, wg in pairs:
w = ws * wg
if not w:
continue
total += w
for g, v in grids([s], list(giv)).items():
cnt[g][v] = cnt[g].get(v, 0) + w
return cnt, total
if __name__ == "__main__":
c3, t3 = tally(True)
c2, t2 = tally(False)
print("three-character names: {} two-character names: {}".format(t3, t2))
print("percent of three-character names whose grid equals n")
print(" n tian ren di wai zong")
for n in range(1, 41):
row = [100 * c3[g].get(n, 0) / t3 for g in GRIDS]
print("{:>2} ".format(n) + " ".join("{:5.2f}".format(x) for x in row))
for g in GRIDS:
vals = c3[g]
lo = sum(w for v, w in vals.items() if v <= 40) / t3
good = sum(w for v, w in vals.items() if v in JI) / t3
print("three-char {:<4}: min {:>2} max {:>2}; share in 1-40 {:.4f}; share good {:.4f}".format(
g, min(vals), max(vals), lo, good))
print("two-char wai is always {}; two-char ren equals zong for every name: {}".format(
sorted(c2["wai"]), c2["ren"] == c2["zong"]))
m = min(min(grids(list(s), list(g)).values()) for s in ((1,), (1, 1)) for g in ((1,), (1, 1)))
print("smallest value any grid can take with every character at 1 stroke, all four layouts: {}".format(m))
over = sum(w for v, w in c3["zong"].items() if v > 81)
print("three-char names whose total exceeds 81 and must fold: {}".format(over))Single source and citation
Fan, Y. (2026). The Name-Number, Digit-Field and Brand-Naming Codex (Version 0.1.0), Chapter 2: The Eighty-One Numbers, Part One: 1 to 40. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-127 · v0.1.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026127,
author = {Fan, Yafu},
title = {The Name-Number, Digit-Field and Brand-Naming Codex},
year = {2026},
publisher = {5D Library},
edition = {0.1.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Method: Kangxi Strokes, the Five-Grid Formulas, the Cycle Above 81 and Base Rates
- Chapter 3 · The Eighty-One Numbers, Part Two: 41 to 81
- Chapter 4 · The 125 Three-Talent Configurations and the Division of Labour among the Five Grids
- Chapter 5 · Sound and Shape: Sixteen Tone Patterns, Eight Glyph Structures and Three Homophone Checks
- Chapter 6 · The Eight Stars of Digit Pairs: Sixty-Four Pairs, Plain, Hidden and Shown, and the Weight of the Tail
- Chapter 7 · Brand-Naming Rules: Trade Word, Trademark, Sound-Alikes, Domains, Dialects, Recall and Length
- Chapter 8 · Practice: A Fictional Founder's Name, Studio Brand and Phone Number, and Three Pre-Registered Tests