What does Modular Numerology conclude, in numbers, about “The Digital Root Is the Residue Modulo 9”?
Answer: Chapter 1 proves that the digital root is the residue modulo 9, a ring homomorphism that can be computed in any order; the stopping rule for the master numbers 11, 22 and 33 reads digits rather than residues, so four published methods give different numbers, pair by pair, on 0.0956 to 0.1608 of the dates from 1900 to 2099, yet never disagree about the residue.
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: 0.0956, 0.1608, 11, 22, 33
| 73,049 dates; all four agree modulo 9 on every date: True | |
| share of dates given a master number (11, 22 or 33): | |
| A | 0.1476 |
| B | 0.1002 |
| C | 0.0956 |
| D | 0.0000 |
| share of dates on which two conventions print different numbers: | |
| A vs B | 0.1420 |
| A vs C | 0.1608 |
| A vs D | 0.1476 |
| B vs C | 0.1130 |
| B vs D | 0.1002 |
| C vs D | 0.0956 |
| Reading: the conventions never disagree about the residue; they | |
| disagree only about whether to stop at a master number, and the | |
| same birthday is a master number under one rule and not another. |
Key formula
Show the full program
# Chapter 1. Four published ways to compute a life path number.
# A sum every digit of the date, then reduce, stopping at 11/22/33
# B reduce year, month and day separately (keeping 11 and 22), add,
# then reduce, stopping at 11/22/33
# C add year + month + day as numbers, then reduce with the stop rule
# D plain digital root, no master numbers
# All four agree modulo 9 on every date. We count, over every day from
# 1 January 1900 to 31 December 2099, how often they give different
# printed numbers.
import datetime as dt
MASTERS = (11, 22, 33)
def digit_sum(n):
return sum(int(c) for c in str(n))
def red(n):
while n > 9 and n not in MASTERS:
n = digit_sum(n)
return n
def conventions(y, m, d):
a = red(digit_sum(y) + digit_sum(m) + digit_sum(d))
b = red(red(y) + red(m) + red(d))
c = red(y + m + d)
e = 1 + (y + m + d - 1) % 9
return {"A": a, "B": b, "C": c, "D": e}
def all_dates(y0=1900, y1=2099):
d, end = dt.date(y0, 1, 1), dt.date(y1, 12, 31)
while d <= end:
yield d
d += dt.timedelta(days=1)
if __name__ == "__main__":
keys = "ABCD"
n = 0
master = {k: 0 for k in keys}
differ = {(p, q): 0 for i, p in enumerate(keys) for q in keys[i + 1:]}
mod_ok = True
for day in all_dates():
v = conventions(day.year, day.month, day.day)
n += 1
for k in keys:
master[k] += v[k] in MASTERS
for p, q in differ:
differ[p, q] += v[p] != v[q]
mod_ok &= len({x % 9 for x in v.values()}) == 1
print(" {:,d} dates; all four agree modulo 9 on every date: {}"
.format(n, mod_ok))
print(" share of dates given a master number (11, 22 or 33):")
for k in keys:
print(" {}: {:.4f}".format(k, master[k] / n))
print(" share of dates on which two conventions print different"
" numbers:")
for (p, q), c in differ.items():
print(" {} vs {}: {:.4f}".format(p, q, c / n))
print("\nReading: the conventions never disagree about the residue; they")
print("disagree only about whether to stop at a master number, and the")
print("same birthday is a master number under one rule and not another.")Single source and citation
Fan, Y. (2026). Modular Numerology, Character-Stroke Hashes and Residue-Class Distributions (Version 1.0.0), Chapter 1: The Digital Root Is the Residue Modulo 9. 5D Library. https://doi.org/10.5281/zenodo.24090178
DOI: 10.5281/zenodo.24090178 · Read the monograph · 5DL-B-065 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026065,
author = {Fan, Yafu},
title = {Modular Numerology, Character-Stroke Hashes and Residue-Class Distributions},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.24090178},
url = {https://doi.org/10.5281/zenodo.24090178}
}Other chapter answers in this book
- Chapter 2 · The Base Rates of Life Path Numbers
- Chapter 3 · The Alphabet Modulo 9: Name Numbers and Two Letter Tables
- Chapter 4 · Kangxi Strokes: Radical Restoration Is a Fixed Map
- Chapter 5 · The Five Grids and the Eighty-One Numbers: Convolution and Modulo 80
- Chapter 6 · Phone Numbers: Modulo 80, XOR and Compressed Numbers
- Chapter 7 · Eighty-One Parts, Five Hundred and Forty Radicals and the Kangxi Dictionary
- Chapter 8 · A Four-Step Check and a Pre-Registered Matching Test