What does Tzolkin Gears and Gate Networks conclude, in numbers, about “The Tzolkin as Two Coprime Gears”?

Answer: Chapter 1 writes the tzolkin with the Chinese remainder theorem: 13 and 20 are coprime, so all 260 combinations occur, whereas the sexagenary cycle, with greatest common divisor 2 of 10 and 12, uses only 60 of 120; the Calendar Round is 18980 days, 52 haab years; 365 leaves 5 modulo 20, so the year bearers can only be one residue class modulo 5, Ik, Manik, Eb and Kaban when 0 Pop is new year.

Scope of the numbers: Marked boxes separate published evidence, runnable Python calculations (16 programs), classical sources and the author's hypotheses.

中文版

Data table

The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 10, 12, 120, 13, 20, 260

tzolkin13 x 20: gcd 1, cycle 260, pairs reached 260 of 260
ganzhi10 x 12: gcd 2, cycle 60, pairs reached 60 of 120
CRT coefficients40 mod 13 = 1, 40 mod 20 = 0
221 mod 130, 221 mod 20 = 1
inverse formula recovers every day: True
first days1 Imix, 2 Ik, 3 Akbal, 4 Kan, 5 Chikchan
day 13 and 201 Ix, 8 Imix
1 Imix recurs only at day [0] (mod 260)

Key formula

\[d \equiv 40\,(t-1) + 221\,(s-1) \pmod{260},\]
Show the full program
# 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))

Single source and citation

Fan, Y. (2026). Mayan Tzolkin Modular Gears, Oracle-Cross Involutions and Sixty-Four-Gate Network Percolation (Version 1.0.0), Chapter 1: The Tzolkin as Two Coprime Gears. 5D Library. https://doi.org/10.5281/zenodo.24090193

DOI: 10.5281/zenodo.24090193 · Read the monograph · 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}
}

Other chapter answers in this book