What does Wuge Numerology, Kangxi Strokes and Zodiac Cohorts conclude, in numbers, about “The 81-Number Table Is Mostly Last Digits”?

Answer: Chapter 2 shows that the 81-number table is mostly last digits: a two-part last-digit rule agrees with it on a share of 0.778, and none of two thousand random tables shows such regularity.

Scope of the numbers: Its good-and-bad table is one widely circulated version, population figures are sourced, and other parameters are illustrative; all calculations are generated by its programs; the book is not naming, marriage, family-planning or investment advice. Marked boxes separate published evidence, runnable Python calculations (16 programs), classical sources and the author's hypotheses.

中文版

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: 0.778, 81

last digitnumbersgoodshare good
0800.000
1970.778
2820.250
3850.625
4810.125
5860.750
6820.250
7860.750
8840.500
9820.250
good among 1 to 48: 27 of 48; among 49 to 81: 8 of 33
two-part rule agrees on 63 of 81 (0.778)
Show the full program
# Chapter 2. p03: How much of the 81-number table is its last digit?
# For each residue of n modulo 10 we print how many of the numbers 1 to
# 81 with that last digit are good, and the share. Then a two-part rule
# read off the table: "good if the last digit is 1, 3, 5, 7 or 8, and
# n is at most 48" and the share of the 81 numbers it labels correctly.
# Exact; no sampling.
GOOD = {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}

def rule(n):
    return n % 10 in (1, 3, 5, 7, 8) and n <= 48

if __name__ == "__main__":
    print("   last digit   numbers   good   share good")
    for r in range(10):
        ns = [n for n in range(1, 82) if n % 10 == r]
        g = sum(n in GOOD for n in ns)
        print("   {:10d}   {:7d}   {:4d}   {:10.3f}".format(
            r, len(ns), g, g / len(ns)))
    lo = sum(n in GOOD for n in range(1, 49))
    hi = sum(n in GOOD for n in range(49, 82))
    print("   good among 1 to 48: {} of 48; among 49 to 81: {} of 33"
          .format(lo, hi))
    hit = sum(rule(n) == (n in GOOD) for n in range(1, 82))
    print("   two-part rule agrees on {} of 81 ({:.3f})".format(
        hit, hit / 81))

Single source and citation

Fan, Y. (2026). Wuge Name Numerology Congruences, Kangxi Radical Stroke Traps and Zodiac Demographic Shocks (Version 1.0.0), Chapter 2: The 81-Number Table Is Mostly Last Digits. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 5DL-B-109 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026109,
  author    = {Fan, Yafu},
  title     = {Wuge Name Numerology Congruences, Kangxi Radical Stroke Traps and Zodiac Demographic Shocks},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book