关于「卓尔金历的双模同余齿轮」,《卓尔金、神谕与闸门的数学》给出的定量结论是什么?
结论:第一章用中国剩余定理写出卓尔金历:13 与 20 互素,260 种组合全部出现,而干支因 10 与 12 的最大公约数为 2 只出现 120 种中的 60 种;历法轮为 18980 日,等于 52 个哈布年;365 模 20 余 5,所以年承载者只能是模 5 的一个剩余类,以 0 Pop 为新年时为 Ik、Manik、Eb、Kaban。
数据口径:书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的假说。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 10, 12, 120, 13, 20, 260
| tzolkin | 13 x 20: gcd 1, cycle 260, pairs reached 260 of 260 |
| ganzhi | 10 x 12: gcd 2, cycle 60, pairs reached 60 of 120 |
| CRT coefficients | 40 mod 13 = 1, 40 mod 20 = 0 |
| 221 mod 13 | 0, 221 mod 20 = 1 |
| inverse formula recovers every day: True | |
| first days | 1 Imix, 2 Ik, 3 Akbal, 4 Kan, 5 Chikchan |
| day 13 and 20 | 1 Ix, 8 Imix |
| 1 Imix recurs only at day [0] (mod 260) |
核心公式
\[d \equiv 40\,(t-1) + 221\,(s-1) \pmod{260},\]
查看完整验算程序
# Chapter 1. p01: The 260-day count as Z13 x Z20 - and why the Chinese
# sexagenary cycle has only 60 pairs.
# Day d (0..259) of the tzolkin carries tone t = d mod 13 + 1 and day sign
# s = d mod 20 + 1 (1 = Imix ... 20 = Ajaw). Because gcd(13, 20) = 1 the
# Chinese remainder theorem makes (t, s) a bijection, with inverse
# d = (40 (t - 1) + 221 (s - 1)) mod 260,
# since 40 = 1 mod 13, 40 = 0 mod 20, 221 = 0 mod 13, 221 = 1 mod 20.
# Stems (10) and branches (12) have gcd 2: only pairs of equal parity occur.
from math import gcd
SIGNS = ("Imix", "Ik", "Akbal", "Kan", "Chikchan", "Kimi", "Manik",
"Lamat", "Muluk", "Ok", "Chuwen", "Eb", "Ben", "Ix", "Men",
"Kib", "Kaban", "Etznab", "Kawak", "Ajaw")
def pairs(m, n):
return {(d % m, d % n) for d in range(m * n)}
if __name__ == "__main__":
for m, n, name in ((13, 20, "tzolkin 13 x 20"), (10, 12,
"ganzhi 10 x 12")):
p = pairs(m, n)
print(" {}: gcd {}, cycle {}, pairs reached {} of {}".format(
name, gcd(m, n), m * n // gcd(m, n), len(p), m * n))
print(" CRT coefficients: 40 mod 13 = {}, 40 mod 20 = {}".format(
40 % 13, 40 % 20))
print(" 221 mod 13 = {}, 221 mod 20 = {}".format(
221 % 13, 221 % 20))
ok = all((40 * (d % 13) + 221 * (d % 20)) % 260 == d for d in range(260))
print(" inverse formula recovers every day: {}".format(ok))
print(" first days: " + ", ".join(
"{} {}".format(d % 13 + 1, SIGNS[d % 20]) for d in range(0, 5)))
print(" day 13 and 20: {} {}, {} {}".format(
13 % 13 + 1, SIGNS[13 % 20], 20 % 13 + 1, SIGNS[20 % 20]))
same = [d for d in range(260) if d % 13 + 1 == 1 and d % 20 == 0]
print(" 1 Imix recurs only at day {} (mod 260)".format(same))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《玛雅卓尔金双模齿轮、神谕十字对合变换与六十四闸门网络渗流》第 1 章「卓尔金历的双模同余齿轮」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090193
DOI: 10.5281/zenodo.24090193 · 阅读本章所在专著 · 5DL-B-072 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026072,
author = {Fan, Yafu},
title = {Mayan Tzolkin Modular Gears, Oracle-Cross Involutions and Sixty-Four-Gate Network Percolation},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.24090193},
url = {https://doi.org/10.5281/zenodo.24090193}
}