关于「二十二张大牌:正向、逆向与投射」,《人类图、卓尔金历与塔罗投射》给出的定量结论是什么?
结论:本章按引擎的编号把 22 张大牌逐张写完,每张五段:结构、正向、逆向、投射、决策规则。p25 给出基率:一张指定的大牌出现在十张牌阵里的概率是 0.1282,但十张牌阵至少有一张大牌的概率是 0.9717,平均 2.8205 张。p26 按引擎的鸽尾洗牌模拟了正逆:倒着的比例 0.4987,十张里倒着张数的方差 2.5663,与独立模型几乎相同,逆向不成串。p27 说明「它又来了」的感觉为什么常见:连读五次,总有某张大牌出现三次以上的概率是 0.3220,而事先指定的那一张只有 0.01723。投射段要求你在把一张牌安到别人身上之前,先检查一遍那是不是你自己;决策规则要求每一次读牌都落到一件写得清、查得到的事上。
数据口径:全部计算由书中程序生成;本书不是投资、法律、医疗或心理建议。 书中以标注框区分已发表的证据、可运行的 Python 计算、原典与作者的假说。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 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 |
查看完整验算程序
# 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)))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《人类图通道、玛雅卓尔金历与七十八塔罗投射母典》第 5 章「二十二张大牌:正向、逆向与投射」(版本 1.0.0). 5D Library. DOI 待发布
DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 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}
}