What does Tarot, Lenormand and Tree Graphs conclude, in numbers, about “Information, Repeats and the Base Rate of "Something Special"”?
Answer: Chapter 5 computes information and multiple comparisons: two Celtic Crosses share at least one card with probability 0.7689, and a random spread shows at least one of eight common features with probability 0.9099.
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.7689
| layout bits | |
| 3 cards, upright only | 18.80 |
| 3 cards with reversals | 21.80 |
| Celtic Cross, reversals | 71.99 |
| Lenormand Grand Tableau | 138.09 |
| two Celtic Crosses: shared cards S | |
| S | 0 0.2311 |
| S | 1 0.3916 |
| S | 2 0.2644 |
| S | 3 0.0925 |
| S | 4 0.0183 |
| E[S] | 1.2821; P(S >= 1) = 0.7689; P(S >= 2) = 0.3773 |
| a named card in r spreads of 10: | |
| r | 1 P(at least once) = 0.1282 |
| r | 3 P(at least once) = 0.3374 |
| r | 5 P(at least once) = 0.4964 |
| r | 10 P(at least once) = 0.7464 |
| r | 20 P(at least once) = 0.9357 |
| P(a Celtic Cross holds at least one major) | 0.9717 |
Show the full program
# Chapter 5. p11: How much a spread can say, and how often cards repeat.
# (1) Information: log2 of the number of distinguishable layouts.
# (2) Repeats: two independent 10-card spreads from a full deck share
# S cards, S hypergeometric with mean 100/78. "The same card again"
# is the rule, not the exception.
# (3) Over a run of readings: P(a named card appears at least once in
# r spreads of 10).
from fractions import Fraction
from math import comb, factorial, log2
def bits(n):
return log2(n)
if __name__ == "__main__":
rows = [("3 cards, upright only", 78 * 77 * 76),
("3 cards with reversals", 78 * 77 * 76 * 8),
("Celtic Cross, reversals",
factorial(78) // factorial(68) * 2 ** 10),
("Lenormand Grand Tableau", factorial(36))]
print(" layout bits")
for name, n in rows:
print(" {:24s} {:7.2f}".format(name, bits(n)))
share = [Fraction(comb(10, s) * comb(68, 10 - s), comb(78, 10))
for s in range(11)]
mean = sum(s * p for s, p in enumerate(share))
print("\n two Celtic Crosses: shared cards S")
for s in range(5):
print(" S = {} {:.4f}".format(s, float(share[s])))
print(" E[S] = {:.4f}; P(S >= 1) = {:.4f}; P(S >= 2) = {:.4f}".format(
float(mean), float(1 - share[0]), float(1 - share[0] - share[1])))
print("\n a named card in r spreads of 10:")
for r in (1, 3, 5, 10, 20):
p = 1 - (Fraction(68, 78)) ** r
print(" r = {:2d} P(at least once) = {:.4f}".format(r, float(p)))
one_of_22 = 1 - Fraction(comb(56, 10), comb(78, 10))
print(" P(a Celtic Cross holds at least one major) = {:.4f}".format(
float(one_of_22)))Single source and citation
Fan, Y. (2026). Tarot Hypergeometric Sampling, Lenormand Grid Topology and Kabbalistic Tree Graphs (Version 1.0.0), Chapter 5: Information, Repeats and the Base Rate of "Something Special". 5D Library. https://doi.org/10.5281/zenodo.24090191
DOI: 10.5281/zenodo.24090191 · Read the monograph · 5DL-B-071 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026071,
author = {Fan, Yafu},
title = {Tarot Hypergeometric Sampling, Lenormand Grid Topology and Kabbalistic Tree Graphs},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.24090191},
url = {https://doi.org/10.5281/zenodo.24090191}
}Other chapter answers in this book
- Chapter 1 · Hypergeometric Sampling of Seventy-Eight Cards
- Chapter 2 · Shuffles, Mixing Times and the Correlation of Reversals
- Chapter 3 · The Grid Combinatorics of the Lenormand Grand Tableau
- Chapter 4 · The Tree of Life as a Graph: Spectrum, Centrality and Paths
- Chapter 6 · The Barnum Effect: a Coverage Model and Selective Recall
- Chapter 7 · The Sefer Yetzirah, Kircher's Tree and Waite's Numbering
- Chapter 8 · A Four-Step Check and Two Pre-Registered Studies