关于「八十一数之一:从 1 到 40」,《姓名数理、数字磁场与品牌改运命名母典》给出的定量结论是什么?

结论:第二、三章写八十一数:2 到 39 之间,多算或少算一笔使等级翻转的平均机会是 0.684;三字名的总格最大只到 62,41 到 81 主要属于品牌全称,四字串里有 71.64% 落在这一段。

数据口径:这些读法能否描述一个人、能否预示一门生意的成败,没有得到证实,本书也不主张;名字与数字通过念起来是否流畅、方言谐音与共同的文化偏好影响生意,这一部分有已发表的证据,本书当作真实机制来写,其余一律放进假说框并写明怎样证伪。 全部计算由书中程序生成;本书不是法律、投资或任何专业意见。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 与结论吻合的打印值: 39, 62, 81

three-character names: 2536800two-character names: 16912
percent of three-character names whose grid equals n
ntianrendiwaizong
10.000.000.000.000.00
20.000.000.000.000.00
30.890.000.000.000.00
40.890.000.000.660.00
54.460.010.004.640.00
64.460.050.003.970.00
72.680.110.062.650.00
87.140.300.244.640.00
97.140.470.4111.260.00
106.250.610.448.610.00
118.930.990.7911.260.01
126.251.611.599.930.02
138.042.022.1012.580.04
146.252.612.662.650.07
153.573.313.518.610.12
167.144.014.614.640.21
177.144.404.904.640.32
185.364.945.923.310.47
192.685.586.701.990.67
205.365.887.330.660.93
212.685.986.793.311.22
220.895.997.330.001.57
231.795.926.530.001.98
240.006.146.620.002.42
250.005.595.480.002.85
查看完整验算程序
# 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))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《姓名数理、数字磁场与品牌改运命名母典》第 2 章「八十一数之一:从 1 到 40」(版本 0.1.0). 5D Library. DOI 待发布

DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 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}
}

本书其他章节结论