关于「逆位能说明什么,以及符文套组差异的影响」,《黄历布尔格、建除同余与卢恩组合》给出的定量结论是什么?
结论:命运三女神阵没有逆位的概率是 0.3197,是简化算法的 2.56 倍。逆位大多来自第一族与第三族,因为第二族的大多数符文是对称的。套组的变体会使数字略有变化(均值 0.8750 到 1.0000),但没有一种接近简化算法。
数据口径:本书不主张任何一天吉或凶,也不主张卢恩能预示任何事;干支、节气与星宿由公布的天文数据算出,规则的选取与人物参数为示意模型;全部数据由书中程序生成。 书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的假说。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.3197, 0.8750, 1.0000
| stones reversible | mean | P(none) | readings to tell | |
| 24 | 15 | 0.9375 | 0.3197 | 16 |
| 24 | 14 | 0.8750 | 0.3498 | 13 |
| 24 | 16 | 1.0000 | 0.2915 | 21 |
| 25 | 15 | 0.9000 | 0.3378 | 14 |
查看完整验算程序
# Chapter 6. p12: How much the answer depends on the rune set. Modern
# sets differ: some add a blank rune (25 stones, the blank never
# reversed), and makers draw some runes so that 14 or 16 of them look
# different turned over. For each variant: the mean number reversed in a
# Norns reading of 3, the chance of none, and the readings a sceptic
# would need to tell the exact law from the shortcut binomial (3, 1/2)
# by the mean, two-sided alpha 0.05, power 0.80.
import math
from fractions import Fraction
from math import comb
from statistics import NormalDist
def law(n, N, rev):
p = [Fraction(0)] * (n + 1)
for k in range(max(0, n - (N - rev)), min(n, rev) + 1):
pk = Fraction(comb(rev, k) * comb(N - rev, n - k), comb(N, n))
for r in range(k + 1):
p[r] += pk * Fraction(comb(k, r), 2 ** k)
return p
if __name__ == "__main__":
z = NormalDist().inv_cdf(0.975) + NormalDist().inv_cdf(0.80)
print(" stones reversible mean P(none) readings to tell")
for N, rev in ((24, 15), (24, 14), (24, 16), (25, 15)):
p = law(3, N, rev)
mean = float(sum(r * x for r, x in enumerate(p)))
var = float(sum(r * r * x for r, x in enumerate(p))) - mean ** 2
n = math.ceil((z * math.sqrt(var) / (1.5 - mean)) ** 2)
print(" {:6d} {:9d} {:.4f} {:.4f} {:8d}".format(
N, rev, mean, float(p[0]), n))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《黄历择吉布尔格、建除十二直同余与卢恩符文组合学》第 6 章「逆位能说明什么,以及符文套组差异的影响」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090239
DOI: 10.5281/zenodo.24090239 · 阅读本章所在专著 · 5DL-B-091 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026091,
author = {Fan, Yafu},
title = {Almanac Auspicious Boolean Lattices, Jianchu Twelve-Officer Congruences and Runic Combinatorics},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.24090239},
url = {https://doi.org/10.5281/zenodo.24090239}
}