关于「方法:化约算术、九宫基率、双牌空间与卜卦规则的来历」,《卡巴拉生命灵数、雷诺曼三十六牌组合与古典卜卦占星母典》给出的定量结论是什么?

结论:第一章是方法:生命灵数只保留出生日期除以 9 的余数,信息量从 14.42 比特降到 3.42 比特,主数取决于加法顺序;1950 到 2009 年的 21,915 个出生日只有 220 种九宫格;两张雷诺曼牌在对称约定下有 630 种读法、方向约定下有 1260 种;在写明假设的天空模型里,卜卦站只把 0.1356 的合约盘判为「倾向成」;一句对八成人都成立的话说中你,似然比最多 1.25。

数据口径:本书不是投资、法律、税务、医疗或心理建议。

English version

对照数据表

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

   digit root = 1 + (n - 1) mod 9 for every n up to 1,000,000: True
   birth days 21,915; information in the date itself: 14.42 bits
   rule A     12 labels, 3.42 bits, two strangers share a label: 0.0984
   rule B     12 labels, 3.40 bits, two strangers share a label: 0.0999
   no masters  9 labels, 3.17 bits, two strangers share a label: 0.1111
   rules A and B always agree once masters are reduced too: True
   1985-01-09: all digits sum 33 -> rule A 33; parts [5, 1, 9] -> rule B 6
   1985-04-29: all digits sum 38 -> rule A 11; parts [5, 4, 11] -> rule B 2
   1985-06-29: all digits sum 40 -> rule A 4; parts [5, 6, 11] -> rule B 22
   1990-01-02: all digits sum 22 -> rule A 22; parts [1, 1, 2] -> rule B 4
   2000-08-19: all digits sum 20 -> rule A 2; parts [2, 8, 1] -> rule B 11
   disagreement patterns (A, B) from 1985 on: [(2, 11), (4, 22), (11, 2), (22, 4), (33, 6)]
查看完整验算程序
# Chapter 1. p10: Digit reduction is arithmetic mod 9; master numbers are a stopping rule on top of it.
# Repeated digit sums of n end at 1 + (n - 1) mod 9 (casting out nines), because 10 = 1 mod 9.
# Rule A is the station's fleet1_meta.life_path: add every digit of YYYY-MM-DD at once, then keep
# reducing while the total is above 9 and is not 11, 22 or 33. Rule B reduces year, month and day
# separately (keeping 11 and 22), adds the three parts and reduces again with the same stop rule.
# Births: every day of 1950-01-01 .. 2009-12-31 equally likely (an assumption, as in p20).
import datetime as dt
import math
from collections import Counter

MASTER = (11, 22, 33)


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


def reduce(n, keep=MASTER):
    while n > 9 and n not in keep:
        n = digsum(n)
    return n


def rule_a(d):
    return reduce(sum(int(c) for c in d.isoformat() if c.isdigit()))


def rule_b(d):
    parts = [reduce(digsum(x), (11, 22)) for x in (d.year, d.month, d.day)]
    return reduce(sum(parts))


def bits(counter, total):
    return -sum(c / total * math.log2(c / total) for c in counter.values())


if __name__ == "__main__":
    ok = all(reduce(n, ()) == 1 + (n - 1) % 9 for n in range(1, 1000001))
    print("   digit root = 1 + (n - 1) mod 9 for every n up to 1,000,000: {}".format(ok))
    a, b = dt.date(1950, 1, 1), dt.date(2009, 12, 31)
    days = [a + dt.timedelta(i) for i in range((b - a).days + 1)]
    n = len(days)
    ra = Counter(rule_a(d) for d in days)
    rb = Counter(rule_b(d) for d in days)
    plain = Counter(reduce(rule_a(d), ()) for d in days)
    print("   birth days {:,}; information in the date itself: {:.2f} bits".format(n, math.log2(n)))
    for name, c in (("rule A", ra), ("rule B", rb), ("no masters", plain)):
        share = sum((v / n) ** 2 for v in c.values())
        print("   {:<10s} {:2d} labels, {:.2f} bits, two strangers share a label: {:.4f}"
              .format(name, len(c), bits(c, n), share))
    same_root = all(reduce(rule_a(d), ()) == reduce(rule_b(d), ()) for d in days)
    print("   rules A and B always agree once masters are reduced too: {}".format(same_root))
    seen = set()
    for d in days:
        x, y = rule_a(d), rule_b(d)
        if x != y and (x, y) not in seen and d.year >= 1985:
            seen.add((x, y))
            s = sum(int(c) for c in d.isoformat() if c.isdigit())
            parts = [reduce(digsum(v), (11, 22)) for v in (d.year, d.month, d.day)]
            print("   {}: all digits sum {} -> rule A {}; parts {} -> rule B {}"
                  .format(d, s, x, parts, y))
    print("   disagreement patterns (A, B) from 1985 on: {}".format(sorted(seen)))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《卡巴拉生命灵数、雷诺曼三十六牌组合与古典卜卦占星母典》第 1 章「方法:化约算术、九宫基率、双牌空间与卜卦规则的来历」(版本 0.1.0). 5D Library. DOI 待发布

DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-128 · v0.1.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026128,
  author    = {Fan, Yafu},
  title     = {The Life-Path, Lenormand-Pair and Horary-Timing Codex},
  year      = {2026},
  publisher = {5D Library},
  edition   = {0.1.0},
  note      = {DOI pending}
}

本书其他章节结论