关于「数字根就是模 9 的余数」,《数字命理的模算术》给出的定量结论是什么?

结论:第一章证明数字根就是模 9 的余数,是一个可以按任意顺序计算的环同态;大师数 11、22、33 的停止规则读的是数字而不是余数,所以四种通行算法在 1900 年到 2099 年的日期上两两有 0.0956 到 0.1608 给出不同的数,却从不在余数上矛盾。

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

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.0956, 0.1608, 11, 22, 33

73,049 dates; all four agree modulo 9 on every date: True
share of dates given a master number (11, 22 or 33):
A0.1476
B0.1002
C0.0956
D0.0000
share of dates on which two conventions print different numbers:
A vs B0.1420
A vs C0.1608
A vs D0.1476
B vs C0.1130
B vs D0.1002
C vs D0.0956
Reading: the conventions never disagree about the residue; they
disagree only about whether to stop at a master number, and the
same birthday is a master number under one rule and not another.

核心公式

\[\mathrm{dr}(n) = 1 + ((n - 1) \bmod 9).\]
查看完整验算程序
# Chapter 1. Four published ways to compute a life path number.
# A  sum every digit of the date, then reduce, stopping at 11/22/33
# B  reduce year, month and day separately (keeping 11 and 22), add,
#    then reduce, stopping at 11/22/33
# C  add year + month + day as numbers, then reduce with the stop rule
# D  plain digital root, no master numbers
# All four agree modulo 9 on every date. We count, over every day from
# 1 January 1900 to 31 December 2099, how often they give different
# printed numbers.
import datetime as dt

MASTERS = (11, 22, 33)

def digit_sum(n):
    return sum(int(c) for c in str(n))

def red(n):
    while n > 9 and n not in MASTERS:
        n = digit_sum(n)
    return n

def conventions(y, m, d):
    a = red(digit_sum(y) + digit_sum(m) + digit_sum(d))
    b = red(red(y) + red(m) + red(d))
    c = red(y + m + d)
    e = 1 + (y + m + d - 1) % 9
    return {"A": a, "B": b, "C": c, "D": e}

def all_dates(y0=1900, y1=2099):
    d, end = dt.date(y0, 1, 1), dt.date(y1, 12, 31)
    while d <= end:
        yield d
        d += dt.timedelta(days=1)

if __name__ == "__main__":
    keys = "ABCD"
    n = 0
    master = {k: 0 for k in keys}
    differ = {(p, q): 0 for i, p in enumerate(keys) for q in keys[i + 1:]}
    mod_ok = True
    for day in all_dates():
        v = conventions(day.year, day.month, day.day)
        n += 1
        for k in keys:
            master[k] += v[k] in MASTERS
        for p, q in differ:
            differ[p, q] += v[p] != v[q]
        mod_ok &= len({x % 9 for x in v.values()}) == 1
    print("   {:,d} dates; all four agree modulo 9 on every date: {}"
          .format(n, mod_ok))
    print("   share of dates given a master number (11, 22 or 33):")
    for k in keys:
        print("     {}: {:.4f}".format(k, master[k] / n))
    print("   share of dates on which two conventions print different"
          " numbers:")
    for (p, q), c in differ.items():
        print("     {} vs {}: {:.4f}".format(p, q, c / n))
    print("\nReading: the conventions never disagree about the residue; they")
    print("disagree only about whether to stop at a master number, and the")
    print("same birthday is a master number under one rule and not another.")

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《姓名笔画、生命灵数与手机号码的同余映射和分布论》第 1 章「数字根就是模 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}
}

本书其他章节结论