What does The Life-Path, Lenormand-Pair and Horary-Timing Codex conclude, in numbers, about “The Twelve Life Paths and the Nine Missing Digits”?
Answer: Chapter 2: under the station's rule, life path 2 takes only 0.0149 of births and 33 takes 0.0594 (0.0073 when parts are reduced first); people miss 4.489 digits on average, and 0.7029 miss the 3.
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.0073, 0.0149, 0.0594, 33
| births 1950-2009 | 21,915 days; digit sums run from 4 to 48 |
| number rule A rule B digit sums feeding it under rule A | |
| 1 | 0.1111 0.1111 10,19,28,37,46 |
| 2 | 0.0149 0.0397 20 |
| 3 | 0.1112 0.1112 12,21,30,39,48 |
| 4 | 0.0909 0.0883 4,13,31,40 |
| 5 | 0.1112 0.1112 5,14,23,32,41 |
| 6 | 0.0517 0.1038 6,15,24,42 |
| 7 | 0.1110 0.1110 7,16,25,34,43 |
| 8 | 0.1109 0.1109 8,17,26,35,44 |
| 9 | 0.1110 0.1110 9,18,27,36,45 |
| 11 | 0.0963 0.0715 11,29,38,47 |
| 22 | 0.0204 0.0230 22 |
| 33 | 0.0594 0.0073 33 |
| rule A and rule B print the same number on 0.8744 of days | |
| share kept as a master number: rule A 0.1760, rule B 0.1018 | |
| by birth decade, rule A shares of 2 / 11 / 22 / 33: | |
| 1950s | 0.0151 0.0964 0.0298 0.0608 |
| 1960s | 0.0088 0.1027 0.0219 0.0676 |
| 1970s | 0.0038 0.1076 0.0151 0.0728 |
| 1980s | 0.0011 0.1100 0.0088 0.0764 |
| 1990s | 0.0000 0.1109 0.0038 0.0786 |
| 2000s | 0.0608 0.0501 0.0427 0.0000 |
| plain residue (no master numbers): every 1-9 share lies in [0.1109, 0.1112] |
Show the full program
# Chapter 2. p20: Base rates of the twelve life path numbers, and where each one comes from.
# Rule A is the station's fleet1_meta.life_path: add every digit of YYYY-MM-DD, then keep adding
# digits while the total is above 9 and is not 11, 22 or 33. Rule B reduces year, month and day
# separately (keeping 11 and 22), adds the three and reduces again with the same stop rule.
# Births are taken as equally likely on every day from 1950-01-01 to 2009-12-31 (an assumption:
# real births have seasons and weekday effects). The digit sums that feed each number under rule A
# are listed, because they decide how rare 2, 4 and 6 become once 11, 22 and 33 are kept.
import datetime as dt
from collections import Counter, defaultdict
MASTER = (11, 22, 33)
ORDER = [1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 22, 33]
def reduce(n, keep=MASTER):
while n > 9 and n not in keep:
n = sum(int(c) for c in str(n))
return n
def rule_a(d): # identical to the station's life_path(d.isoformat())
return reduce(sum(int(c) for c in d.isoformat() if c.isdigit()))
def rule_b(d):
parts = [reduce(sum(int(c) for c in str(x)), (11, 22)) for x in (d.year, d.month, d.day)]
return reduce(sum(parts))
def days(a, b):
d = a
while d <= b:
yield d
d += dt.timedelta(1)
if __name__ == "__main__":
span = list(days(dt.date(1950, 1, 1), dt.date(2009, 12, 31)))
ca, cb = Counter(), Counter()
feed = defaultdict(set)
sums = Counter()
for d in span:
s = sum(int(c) for c in d.isoformat() if c.isdigit())
sums[s] += 1
a = rule_a(d)
feed[a].add(s)
ca[a] += 1
cb[rule_b(d)] += 1
n = len(span)
print(" births 1950-2009: {:,} days; digit sums run from {} to {}".format(n, min(sums), max(sums)))
print(" number rule A rule B digit sums feeding it under rule A")
for k in ORDER:
f = ",".join(str(x) for x in sorted(feed[k]))
print(" {:>6} {:.4f} {:.4f} {}".format(k, ca[k] / n, cb[k] / n, f))
same = sum(rule_a(d) == rule_b(d) for d in span)
print(" rule A and rule B print the same number on {:.4f} of days".format(same / n))
print(" share kept as a master number: rule A {:.4f}, rule B {:.4f}".format(
sum(ca[k] for k in MASTER) / n, sum(cb[k] for k in MASTER) / n))
print(" by birth decade, rule A shares of 2 / 11 / 22 / 33:")
for y0 in range(1950, 2010, 10):
sub = [d for d in span if y0 <= d.year < y0 + 10]
c = Counter(rule_a(d) for d in sub)
print(" {}s {:.4f} {:.4f} {:.4f} {:.4f}".format(
y0, c[2] / len(sub), c[11] / len(sub), c[22] / len(sub), c[33] / len(sub)))
print(" plain residue (no master numbers): every 1-9 share lies in [{:.4f}, {:.4f}]".format(
min(sum(1 for d in span if reduce(rule_a(d), ()) == k) / n for k in range(1, 10)),
max(sum(1 for d in span if reduce(rule_a(d), ()) == k) / n for k in range(1, 10))))Single source and citation
Fan, Y. (2026). The Life-Path, Lenormand-Pair and Horary-Timing Codex (Version 0.1.0), Chapter 2: The Twelve Life Paths and the Nine Missing Digits. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-128 · v0.1.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026128,
author = {Fan, Yafu},
title = {The Life-Path, Lenormand-Pair and Horary-Timing Codex},
year = {2026},
publisher = {5D Library},
edition = {0.1.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Method: Reduction Arithmetic, Grid Base Rates, the Pair Space and the Sources of Horary Rules
- Chapter 3 · The Nine-Year Personal-Year Cycle: How a Nine-Step Clock Sets the Annual Rhythm of a Business
- Chapter 4 · Lenormand Pairs I: Rider to Dog, Eighteen Modifiers Beside Six Anchors
- Chapter 5 · Lenormand Pairs II: Cards 19 to 36 as Modifiers
- Chapter 6 · The Twelve Houses of a Horary Question and Six Considerations Before Judgement
- Chapter 7 · Seven Ways a Matter Perfects and Nine Units of Timing
- Chapter 8 · Practice: Will a Hotel Contract Be Signed by Month End? Three Lines, Walked Through