关于「卢恩符文的逆位:超几何-二项复合分布」,《黄历布尔格、建除同余与卢恩组合》给出的定量结论是什么?

结论:第五章推导卢恩逆位的精确分布:古弗萨克 24 个符文中只有 15 个可逆,抽出的符文逆位概率是 0.3125,命运三女神阵没有逆位的概率是 0.320 而不是 0.125;

数据口径:本书不主张任何一天吉或凶,也不主张卢恩能预示任何事;干支、节气与星宿由公布的天文数据算出,规则的选取与人物参数为示意模型;全部数据由书中程序生成。 书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的假说。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.125, 0.3125, 0.320, 15, 24

   runes 24, reversible 15, same when turned 9
   one rune : mean reversed 0.3125 (shortcut 0.5, 1.6 x)
     r         0     1
     exact 0.688 0.312
     short 0.500 0.500
   Norns, 3 : mean reversed 0.9375 (shortcut 1.5, 1.6 x)
     r         0     1     2     3
     exact 0.320 0.451 0.201 0.028
     short 0.125 0.375 0.375 0.125
   cross, 5 : mean reversed 1.5625 (shortcut 2.5, 1.6 x)
     r         0     1     2     3     4     5
     exact 0.146 0.354 0.327 0.143 0.029 0.002
     short 0.031 0.156 0.312 0.312 0.156 0.031
   nine     : mean reversed 2.8125 (shortcut 4.5, 1.6 x)
     r         0     1     2     3     4     5     6     7     8     9
     exact 0.028 0.132 0.261 0.286 0.190 0.079 0.020 0.003 0.000 0.000
     short 0.002 0.018 0.070 0.164 0.246 0.246 0.164 0.070 0.018 0.002
查看完整验算程序
# Chapter 5. p09: How many reversed runes in a draw? Of the 24 runes of
# the Elder Futhark, 9 look the same turned upside down (Gebo, Hagalaz,
# Naudhiz, Isa, Jera, Eihwaz, Sowilo, Ingwaz, Dagaz), so only 15 can be
# read "reversed" (merkstave). Drawing n runes without replacement, the
# number K of reversible runes is hypergeometric (24, 15, n); each lands
# reversed with probability 1/2, so R given K is binomial (K, 1/2). The
# exact law of R is compared with the common shortcut binomial (n, 1/2).
from fractions import Fraction
from math import comb

FUTHARK = ("Fehu Uruz Thurisaz Ansuz Raidho Kenaz Gebo Wunjo "
           "Hagalaz Naudhiz Isa Jera Eihwaz Perthro Algiz Sowilo "
           "Tiwaz Berkano Ehwaz Mannaz Laguz Ingwaz Dagaz Othala").split()
SAME_TURNED = {"Gebo", "Hagalaz", "Naudhiz", "Isa", "Jera", "Eihwaz",
               "Sowilo", "Ingwaz", "Dagaz"}

def exact(n, N=24, rev=15):
    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

def naive(n):
    return [Fraction(comb(n, r), 2 ** n) for r in range(n + 1)]

if __name__ == "__main__":
    rev = sum(1 for r in FUTHARK if r not in SAME_TURNED)
    print("   runes {}, reversible {}, same when turned {}".format(
        len(FUTHARK), rev, len(SAME_TURNED)))
    for n, name in ((1, "one rune"), (3, "Norns, 3"), (5, "cross, 5"),
                    (9, "nine")):
        e, b = exact(n), naive(n)
        mean = sum(r * x for r, x in enumerate(e))
        print("   {:9s}: mean reversed {:.4f} (shortcut {:.1f}, {:.1f} x)"
              .format(name, float(mean), n / 2, n / 2 / float(mean)))
        print("     r    " + "".join("{:6d}".format(r) for r in range(n + 1)))
        print("     exact" + "".join("{:6.3f}".format(float(x)) for x in e))
        print("     short" + "".join("{:6.3f}".format(float(x)) for x in b))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《黄历择吉布尔格、建除十二直同余与卢恩符文组合学》第 5 章「卢恩符文的逆位:超几何-二项复合分布」(版本 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}
}

本书其他章节结论