What does Human Design, Tzolkin and Tarot Projection conclude, in numbers, about “The Twenty-Two Majors: Upright, Reversed and Projected”?
Answer: This chapter wrote out the 22 majors one by one in the engine's numbering, each in five parts: structure, upright, reversed, projection and decision rule. p25 gives the base rates: one named major appears in a ten-card spread with probability 0.1282, but a ten-card spread holds at least one major with probability 0.9717, and 2.8205 on average. p26 simulates orientation under the engine's riffle shuffle: the reversed share is 0.4987, the variance of the number reversed among ten is 2.5663, almost the same as the independent model, and reversals do not come in runs. p27 shows why the feeling "there it is again" is so common: over five readings, the chance that some major appears three or more times is 0.3220, while for one major named in advance it is only 0.01723. The projection parts ask you, before pinning a card on someone else, to check whether it is you; the decision rules ask that every reading end in one thing you can write down clearly and check later.
Scope of the numbers: All calculations are generated by the book's programs; it is not investment, legal, medical or psychological advice. Marked boxes separate published evidence, runnable Python calculations, 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.1282, 0.9717, 2.8205, 22
| one named card in an n-card spread (any / upright only) | |
| n | 1: 0.0128 / 0.0064 |
| n | 3: 0.0385 / 0.0192 |
| n | 10: 0.1282 / 0.0641 |
| n | 3: expected majors 0.8462 |
| k P(K = k) P(K >= k) | |
| 0 | 0.3644 1.0000 |
| 1 | 0.4453 0.6356 |
| 2 | 0.1700 0.1903 |
| 3 | 0.0202 0.0202 |
| every major in the spread upright | 0.6321 |
| expected reversed majors | 0.4231 |
| n | 10: expected majors 2.8205 |
| k P(K = k) P(K >= k) | |
| 0 | 0.0283 1.0000 |
| 1 | 0.1325 0.9717 |
| 2 | 0.2608 0.8392 |
| 3 | 0.2838 0.5785 |
| 4 | 0.1887 0.2946 |
| 5 | 0.0799 0.1059 |
| 6 | 0.0218 0.0259 |
| every major in the spread upright | 0.2099 |
| expected reversed majors | 1.4103 |
| one named card seen at least once over repeated draws | |
| 1 card daily, 30 days | 0.3210 |
| 3 cards daily, 30 days | 0.6917 |
| 10 cards monthly, 12 months | 0.8073 |
| 10 cards weekly, 52 weeks | 0.9992 |
Show the full program
# Chapter 5. p25: Odds that one named major, or any major, shows up in a spread.
# A 78-card deck holds 22 majors (indices 0-21) and 56 minors. A spread of
# n cards is dealt without replacement, so one named card lands in it with
# probability n/78 exactly, and the number of majors K is hypergeometric:
# P(K = k) = C(22, k) C(56, n - k) / C(78, n). Orientation is taken as a
# fair coin per card (the independent model; p26 checks the engine's own
# shuffle against it). Repeated draws on different days are independent.
from fractions import Fraction
from math import comb
N, MAJ = 78, 22
def hyper(n, k):
return Fraction(comb(MAJ, k) * comb(N - MAJ, n - k), comb(N, n))
def at_least_once(n, days):
return 1 - Fraction(N - n, N) ** days
if __name__ == "__main__":
print(" one named card in an n-card spread (any / upright only)")
for n in (1, 3, 10):
p = Fraction(n, N)
print(" n = {:2d}: {:.4f} / {:.4f}".format(n, float(p), float(p / 2)))
for n in (3, 10):
mean = Fraction(n * MAJ, N)
print("\n n = {}: expected majors {:.4f}".format(n, float(mean)))
print(" k P(K = k) P(K >= k)")
for k in range(0, min(n, 6) + 1):
tail = sum(hyper(n, j) for j in range(k, n + 1))
print(" {:2d} {:.4f} {:.4f}".format(k, float(hyper(n, k)), float(tail)))
allup = sum(hyper(n, k) * Fraction(1, 2 ** k) for k in range(0, n + 1))
print(" every major in the spread upright: {:.4f}".format(float(allup)))
print(" expected reversed majors: {:.4f}".format(float(mean / 2)))
print("\n one named card seen at least once over repeated draws")
for n, days, label in ((1, 30, "1 card daily, 30 days"), (3, 30, "3 cards daily, 30 days"),
(10, 12, "10 cards monthly, 12 months"), (10, 52, "10 cards weekly, 52 weeks")):
print(" {:28s} {:.4f}".format(label, float(at_least_once(n, days))))
seen = MAJ * (1 - (Fraction(N - 3, N) ** 30))
print(" distinct majors expected in 30 daily 3-card draws: {:.4f} of 22".format(float(seen)))Single source and citation
Fan, Y. (2026). The Human Design, Tzolkin and Seventy-Eight Tarot Projection Codex (Version 1.0.0), Chapter 5: The Twenty-Two Majors: Upright, Reversed and Projected. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-126 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026126,
author = {Fan, Yafu},
title = {The Human Design, Tzolkin and Seventy-Eight Tarot Projection Codex},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Method: The Gate Wheel, the 260 Days and the 78 Cards
- Chapter 2 · The Thirty-Six Channels: Fixed Lines of Energy Once Two Gates Connect
- Chapter 3 · Nine Centres, Five Types and Twelve Profiles
- Chapter 4 · Twenty Seals and Thirteen Tones: One Table, Two Ways of Counting
- Chapter 6 · Wands and Cups: Twenty-Eight Cards of Fire for Action and Water for Ties
- Chapter 7 · Swords and Pentacles: Twenty-Eight Cards of Air for Judgement and Earth for Money
- Chapter 8 · Practice: Sample Chart A Through the Station, Three Cards, and a Blind-Matching Test with Barnum Controls