关于「联合周期:干支日、二十八宿与七曜」,《黄历布尔格、建除同余与卢恩组合》给出的定量结论是什么?
结论:第三章说明干支日与二十八宿只有 420 种组合、每 420 天重复,同一日期两年判定相同的比例只有 0.685(偶然 0.619)。
数据口径:本书不主张任何一天吉或凶,也不主张卢恩能预示任何事;干支、节气与星宿由公布的天文数据算出,规则的选取与人物参数为示意模型;全部数据由书中程序生成。 书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的假说。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 28, 420
| gcd(60, 28) | 4, lcm = 420 |
| distinct (stem-branch, lodge) pairs in 1,680 days | 420 of 1,680 |
| first repeated pair after 420 days | |
| every lodge keeps one weekday: True | |
| lodge 0 (Jiao) falls on weekday 3 (0 = Monday) | |
| in 365 days | 365 distinct pairs |
| cycles 60 and 12: gcd 12, joint period | 60 days |
| cycles 60 and 10: gcd 10, joint period | 60 days |
| cycles 60 and | 7: gcd 1, joint period 420 days |
| cycles 12 and 28: gcd | 4, joint period 84 days |
查看完整验算程序
# Chapter 3. p05: The day cycles of the almanac and their joint period.
# Stem-branch days repeat every 60 days, the 28 lodges every 28 and the
# week every 7; since 28 = 4 x 7 each lodge always falls on the same
# weekday. gcd(60, 28) = 4, so a (stem-branch, lodge) pair repeats every
# lcm(60, 28) = 420 days and only 420 of the 60 x 28 = 1,680 pairs ever
# occur. Checked by walking 1,680 days from 2027-01-01 (geng-chen, lodge
# Gui, a Friday); also the 7 weekday-planets of the lodges.
import datetime
import math
if __name__ == "__main__":
d0 = datetime.date(2027, 1, 1)
pairs, weekday_of = set(), {}
first_repeat = None
for k in range(1680):
gz, lodge = (16 + k) % 60, (22 + k) % 28
wd = (d0 + datetime.timedelta(days=k)).weekday()
weekday_of.setdefault(lodge, set()).add(wd)
if (gz, lodge) in pairs and first_repeat is None:
first_repeat = k
pairs.add((gz, lodge))
print(" gcd(60, 28) = {}, lcm = {}".format(math.gcd(60, 28),
60 * 28 // math.gcd(60, 28)))
print(" distinct (stem-branch, lodge) pairs in 1,680 days: {} of {:,}"
.format(len(pairs), 60 * 28))
print(" first repeated pair after {} days".format(first_repeat))
print(" every lodge keeps one weekday: {}".format(
all(len(v) == 1 for v in weekday_of.values())))
print(" lodge 0 (Jiao) falls on weekday {} (0 = Monday)".format(
sorted(weekday_of[0])[0]))
print(" in 365 days: {} distinct pairs".format(
len({((16 + k) % 60, (22 + k) % 28) for k in range(365)})))
for n, m in ((60, 12), (60, 10), (60, 7), (12, 28)):
print(" cycles {:2d} and {:2d}: gcd {:2d}, joint period {:3d} days"
.format(n, m, math.gcd(n, m), n * m // math.gcd(n, m)))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《黄历择吉布尔格、建除十二直同余与卢恩符文组合学》第 3 章「联合周期:干支日、二十八宿与七曜」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090239
DOI: 10.5281/zenodo.24090239 · 阅读本章所在专著 · 5DL-B-091 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026091,
author = {Fan, Yafu},
title = {Almanac Auspicious Boolean Lattices, Jianchu Twelve-Officer Congruences and Runic Combinatorics},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.24090239},
url = {https://doi.org/10.5281/zenodo.24090239}
}