What does The Name-Number, Digit-Field and Brand-Naming Codex conclude, in numbers, about “The Eighty-One Numbers, Part Two: 41 to 81”?

Answer: The previous chapter covered 1 to 40; this one covers 41 to 81. The rules are still the tollbooth engine's: whenever any of the five grids comes out above 81, subtract 80 repeatedly until it is no larger than 81, so a raw total of 121 reads as 41 and 161 reads as 81. The three classes, good, half-good and bad, are copied from the engine's two sets, and every number in neither set counts as bad. How radicals are restored, how the five grids are summed, where this reading comes from and where its credibility ends were all set out in Chapter 1, so one reminder is enough here: the Structure paragraph of each section states facts you can check item by item, and the remaining paragraphs are this book's reading for people who run a business. None of it has been validated as a prediction.

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: 161, 40, 41, 80, 81

1..4040 numbers, good 23 (57.5%), half 4, bad 13
41..8141 numbers, good 12 (29.3%), half 9, bad 20
good numbers in 41..8141 45 47 48 52 57 61 63 65 67 68 81
half numbers in 41..8149 51 55 58 71 73 75 77 78
tail wood9 numbers, good 4, half 2, bad 3
tail fire8 numbers, good 1, half 1, bad 6
tail earth8 numbers, good 2, half 2, bad 4
tail metal8 numbers, good 5, half 3, bad 0
tail water8 numbers, good 0, half 1, bad 7
n and n - 40 share a category for 19 of 40 pairs (47.5%)
good below, not good above (n - 40 -> n), 15 pairs:
343 6->46 11->51 13->53 15->55 16->56 18->58 24->64
2969 31->71 32->72 33->73 35->75 37->77 39->79
raw totals 82..161: minus-80 and minus-81 disagree on 59 of 80 (73.8%)
raw 82: minus-802 (bad), minus-81 -> 1 (good)
person-name bonus set inside 41..8141 45 52 63 65 81
brand-name bonus set inside 41..8141 45 47 48 52 63 65 67 68
longest run of bad numbers in 41..813 in a row, from 42 to 44
gaps between good numbers in 41..814 2 1 4 5 4 2 2 2 1 13
Show the full program
# Chapter 3. p31: the shape of the 41-81 table: categories, tail elements, the 81 cycle and its rivals.
# Categories are the engine's (fleet1_meta.JI = good, BAN = half, every other number = bad). The tail
# element is the engine's num_el: last digit 1,2 wood; 3,4 fire; 5,6 earth; 7,8 metal; 9,0 water.
# Reduction above 81: the engine subtracts 80 (82 -> 2, 161 -> 81). Some manuals subtract 81 instead
# (82 -> 1); the program counts how often the two rules disagree on the category of a raw total.
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}
BAN = {27, 30, 38, 40, 49, 51, 55, 58, 71, 73, 75, 77, 78}
EL = ["water", "wood", "wood", "fire", "fire", "earth", "earth", "metal", "metal", "water"]
PERSON_BONUS = {21, 23, 24, 31, 32, 33, 41, 45, 52, 63, 65, 81}      # engine name_compute, person names
BRAND_BONUS = {24, 29, 31, 32, 33, 39, 41, 45, 47, 48, 52, 63, 65, 67, 68}   # engine, brand names


def cat(n):
    return "good" if n in JI else "half" if n in BAN else "bad"


def minus80(n):
    while n > 81:
        n -= 80
    return n


def minus81(n):
    while n > 81:
        n -= 81
    return n


low, high = range(1, 41), range(41, 82)
for name, rng in (("1..40", low), ("41..81", high)):
    c = [cat(n) for n in rng]
    print("   {:6s}: {} numbers, good {} ({:.1f}%), half {}, bad {}".format(
        name, len(c), c.count("good"), 100 * c.count("good") / len(c), c.count("half"), c.count("bad")))
print("   good numbers in 41..81:", " ".join(str(n) for n in high if cat(n) == "good"))
print("   half numbers in 41..81:", " ".join(str(n) for n in high if cat(n) == "half"))
for e in ("wood", "fire", "earth", "metal", "water"):
    ns = [n for n in high if EL[n % 10] == e]
    print("   tail {:5s}: {} numbers, good {}, half {}, bad {}".format(
        e, len(ns), sum(cat(n) == "good" for n in ns), sum(cat(n) == "half" for n in ns),
        sum(cat(n) == "bad" for n in ns)))
same = sum(cat(n) == cat(n - 40) for n in range(41, 81))
print("   n and n - 40 share a category for {} of 40 pairs ({:.1f}%)".format(same, 100 * same / 40))
flips = [n for n in range(41, 81) if cat(n - 40) == "good" and cat(n) != "good"]
print("   good below, not good above (n - 40 -> n), {} pairs:".format(len(flips)))
print("     " + " ".join("{}->{}".format(n - 40, n) for n in flips[:8]))
print("     " + " ".join("{}->{}".format(n - 40, n) for n in flips[8:]))
diff = [t for t in range(82, 162) if cat(minus80(t)) != cat(minus81(t))]
print("   raw totals 82..161: minus-80 and minus-81 disagree on {} of 80 ({:.1f}%)".format(
    len(diff), 100 * len(diff) / 80))
print("   raw 82: minus-80 -> {} ({}), minus-81 -> {} ({})".format(
    minus80(82), cat(minus80(82)), minus81(82), cat(minus81(82))))
print("   person-name bonus set inside 41..81:", " ".join(str(n) for n in high if n in PERSON_BONUS))
print("   brand-name bonus set inside 41..81: ", " ".join(str(n) for n in high if n in BRAND_BONUS))
run, best, start = 0, (0, 0), 0
for n in high:
    if cat(n) == "bad":
        run += 1
        if run > best[0]:
            best = (run, n - run + 1)
    else:
        run = 0
print("   longest run of bad numbers in 41..81: {} in a row, from {} to {}".format(
    best[0], best[1], best[1] + best[0] - 1))
gaps = [b - a for a, b in zip(sorted(n for n in high if cat(n) == "good"),
                              sorted(n for n in high if cat(n) == "good")[1:])]
print("   gaps between good numbers in 41..81:", " ".join(str(g) for g in gaps))

Single source and citation

Fan, Y. (2026). The Name-Number, Digit-Field and Brand-Naming Codex (Version 0.1.0), Chapter 3: The Eighty-One Numbers, Part Two: 41 to 81. 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