关于「五福与大游的大轨道:最小公倍周期、不规则重访与流派分歧的全部所在」,《太乙神数的同余结构与博弈边界》给出的定量结论是什么?

结论:第三章算出五福与大游的联合周期为 7200 年,三种积年的全部分歧都在这两位长周期神上。

数据口径:书中参数为示意;全部计算由书中程序生成;书中灾异年表为固定种子生成的合成数据。 第六章在合成年表上做随机置换检验,最「显著」的格局族系 p 值为 0.501,计入积年与容差的选择后,至少一条路径名义显著的机会是 0.867。

English version

对照数据表

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

god dwell palaces period
Taiyi3 8 24
Wufu45 5 225
Dayou36 8 288
lcm(225, 288)7200; with 24, 72, 360 still 7200
(Wufu, Dayou) palace pairs reached40 of 40; years per pair 180 to 180
(Taiyi, Wufu, Dayou) triples reached320 of 320
years in 7200 with the year-0 palace triple30
separate visits10; gaps between visits: 24 to 1128 years
exact return of every year-in-palace counter7200 years
查看完整验算程序
# Chapter 3. p31: the great orbits. Adopted from later Taiyi manuals
# (stated in the text as a convention, not a Jinjing quotation): Wufu
# dwells 45 years in each of 5 palaces (qian 1, gen 3, xun 9, kun 7,
# centre 5), period 225; Dayou dwells 36 years in each of 8 palaces,
# period 288 (palace order illustrative). Taiyi: 3 years x 8 = 24.
# Everything is counted exactly over the joint period.
import math
from collections import Counter
from functools import reduce

WUFU = (1, 3, 9, 7, 5)
DAYOU = (7, 8, 9, 1, 2, 3, 4, 6)
TY = (1, 2, 3, 4, 6, 7, 8, 9)


def lcm(a, b):
    return a * b // math.gcd(a, b)


def wufu(j):
    return WUFU[j % 225 // 45]


def dayou(j):
    return DAYOU[j % 288 // 36]


def taiyi(j):
    return TY[j % 24 // 3]


if __name__ == "__main__":
    print(" god       dwell  palaces  period")
    for n, d, p in (("Taiyi", 3, 8), ("Wufu", 45, 5), ("Dayou", 36, 8)):
        print(" {:<8} {:>5} {:>8} {:>7}".format(n, d, p, d * p))
    L = reduce(lcm, (24, 72, 360, 225, 288))
    print(" lcm(225, 288) = {}; with 24, 72, 360 still {}".format(
        lcm(225, 288), L))
    pair = Counter((wufu(j), dayou(j)) for j in range(L))
    print(" (Wufu, Dayou) palace pairs reached: {} of 40; years per pair"
          " {} to {}".format(len(pair), min(pair.values()),
                             max(pair.values())))
    tri = Counter((taiyi(j), wufu(j), dayou(j)) for j in range(L))
    print(" (Taiyi, Wufu, Dayou) triples reached: {} of 320".format(
        len(tri)))
    s0 = (taiyi(0), wufu(0), dayou(0))
    hits = [j for j in range(L) if (taiyi(j), wufu(j), dayou(j)) == s0]
    print(" years in {} with the year-0 palace triple: {}".format(
        L, len(hits)))
    starts = [j for j in hits if j == 0 or (taiyi(j - 1), wufu(j - 1),
                                            dayou(j - 1)) != s0]
    gaps = [b - a for a, b in zip(starts, starts[1:] + [starts[0] + L])]
    print(" separate visits: {}; gaps between visits: {} to {} years"
          .format(len(starts), min(gaps), max(gaps)))
    print(" exact return of every year-in-palace counter: {} years"
          .format(L))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《太乙神数十六宫游走、积年同余周期与主客算筹博弈边界》第 3 章「五福与大游的大轨道:最小公倍周期、不规则重访与流派分歧的全部所在」(版本 1.0.0). 5D Library. DOI 待发布

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

BibTeX
@book{fan2026154,
  author    = {Fan, Yafu},
  title     = {Taiyi Shenshu: Sixteen-Palace Walks, Accumulated-Year Congruence Cycles and the Game Bounds of Host and Guest Counting Rods},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论