What does Almanac Lattices, Jianchu Congruences and Runes conclude, in numbers, about “Joint Periods: Stem-Branch Days, the Twenty-Eight Lodges and the Week”?

Answer: Chapter 3 shows that stem-branch days and the 28 lodges have only 420 combinations, repeating every 420 days, and that a date receives the same verdict in two years only 0.685 of the time (0.619 by chance).

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: 28, 420

gcd(60, 28)4, lcm = 420
distinct (stem-branch, lodge) pairs in 1,680 days420 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 days365 distinct pairs
cycles 60 and 12: gcd 12, joint period60 days
cycles 60 and 10: gcd 10, joint period60 days
cycles 60 and7: gcd 1, joint period 420 days
cycles 12 and 28: gcd4, joint period 84 days
Show the full program
# 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)))

Single source and citation

Fan, Y. (2026). Almanac Auspicious Boolean Lattices, Jianchu Twelve-Officer Congruences and Runic Combinatorics (Version 1.0.0), Chapter 3: Joint Periods: Stem-Branch Days, the Twenty-Eight Lodges and the Week. 5D Library. https://doi.org/10.5281/zenodo.24090239

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

Other chapter answers in this book