关于「字母表模 9:名字数与两种字母表」,《数字命理的模算术》给出的定量结论是什么?

结论:第三章把毕达哥拉斯字母表写成字母序号模 9:随机字母两个之后就几乎均匀,只取元音则远不均匀;两种通行字母表给出相同数的比例与互相独立无异,同一个中文名字的三种拼法给出三个不同的数。

数据口径:书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的假说。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库

   value: 1=AJS  2=BKT  3=CLU  4=DMV  5=ENW  6=FOX  7=GPY  8=HQZ  9=IR
   all 26 letters: largest Fourier coefficient 0.0385
   letters k           1      2      3      4      5      6      7      8
   TV from even   0.0342 0.0013 0.0001 0.0000 0.0000 0.0000 0.0000 0.0000
   vowels AEIOU: largest Fourier coefficient 0.4000
   letters k           1      2      3      4      5      6      7      8
   TV from even   0.4444 0.1244 0.0604 0.0188 0.0086 0.0028 0.0013 0.0004
Reading: with random letters the name number is even to about a
thousandth after two letters. Vowels take only five values, and
the vowel number of a short name stays far from even: one vowel
leaves 0.4444 of the probability misplaced, two leave 0.1244.
查看完整验算程序
# Chapter 3. The Pythagorean letter table is the alphabet modulo 9.
# Letter number i (A = 1 ... Z = 26) has value 1 + ((i - 1) mod 9).
# A name's number is the residue of the sum of its letter values. If
# letters were drawn at random, how fast would that residue become even
# over 1-9? The answer is set by the Fourier coefficients of a single
# letter's distribution on Z_9: the sum of k letters has coefficients
# raised to the k-th power. Vowels alone (A E I O U) are far slower.
import cmath
import string

def value(ch):
    return 1 + (string.ascii_uppercase.index(ch)) % 9

def residue_dist(letters):
    p = [0.0] * 9
    for ch in letters:
        p[value(ch) % 9] += 1 / len(letters)
    return p

def convolve(p, q):
    r = [0.0] * 9
    for i in range(9):
        for j in range(9):
            r[(i + j) % 9] += p[i] * q[j]
    return r

def tv_uniform(p):
    return 0.5 * sum(abs(x - 1 / 9) for x in p)

def max_coeff(p):
    return max(abs(sum(p[x] * cmath.exp(-2j * cmath.pi * k * x / 9)
                       for x in range(9))) for k in range(1, 9))

if __name__ == "__main__":
    print("   value: " + "  ".join(
        "{}={}".format(v, "".join(c for c in string.ascii_uppercase
                                  if value(c) == v)) for v in range(1, 10)))
    sets = (("all 26 letters", string.ascii_uppercase), ("vowels AEIOU",
                                                         "AEIOU"))
    for label, letters in sets:
        p1 = residue_dist(letters)
        print("\n   {}: largest Fourier coefficient {:.4f}".format(
            label, max_coeff(p1)))
        print("   letters k     " + "".join("{:>7d}".format(k)
                                            for k in range(1, 9)))
        p, row = p1, []
        for k in range(1, 9):
            row.append(tv_uniform(p))
            p = convolve(p, p1)
        print("   TV from even  " + "".join("{:7.4f}".format(x)
                                              for x in row))
    print("\nReading: with random letters the name number is even to about a")
    print("thousandth after two letters. Vowels take only five values, and")
    print("the vowel number of a short name stays far from even: one vowel")
    print("leaves 0.4444 of the probability misplaced, two leave 0.1244.")

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《姓名笔画、生命灵数与手机号码的同余映射和分布论》第 3 章「字母表模 9:名字数与两种字母表」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090178

DOI: 10.5281/zenodo.24090178 · 阅读本章所在专著 · 5DL-B-065 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026065,
  author    = {Fan, Yafu},
  title     = {Modular Numerology, Character-Stroke Hashes and Residue-Class Distributions},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.24090178},
  url       = {https://doi.org/10.5281/zenodo.24090178}
}

本书其他章节结论