关于「四步核查与一项预注册的配对检验」,《数字命理的模算术》给出的定量结论是什么?

结论:第八章给出四步核查与一项预注册的配对检验(419 名参与者)。书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的假说。

数据口径:书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的假说。

English version

对照数据表

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

   chance hit rate, nine descriptions, even base rates: 0.1111
   chance hit rate, twelve descriptions under rule A,
   with the example preferences q: 0.0945
   (twelve descriptions and even preferences would give 0.0833)
   example preferences q (numbers 1-9, 11, 22, 33):
     1:0.14 2:0.03 3:0.10 4:0.04 5:0.10 6:0.05
     7:0.10 8:0.10 9:0.08 11:0.16 22:0.06 33:0.04
     sum of q = 1.00
   nine descriptions, hit rate 0.16 against 1/9, one-sided 0.05,
   power 0.90: 419 participants, at least 58 hits
Reading: with plain residues the chance level is exactly 1/9
and a pre-registered test needs a few hundred people. With
master numbers the chance level depends on which descriptions
people like, so it must be estimated by shuffling, not assumed.
查看完整验算程序
# Chapter 8. A pre-registered matching test, and its base-rate trap.
# Each participant reads the standard descriptions of the life path
# numbers, unlabelled and in random order, and picks the one most like
# themselves. A hit is a pick of the participant's own number. The
# chance hit rate is sum_k p_k q_k, where p is the population share of
# number k and q the share of participants who pick description k. If
# p is even, this is 1/9 whatever q is; if p is uneven (master numbers,
# rule A) and q favours some descriptions, chance is no longer 1/9.
# q below is an invented example of a preference for flattering texts.
import datetime as dt
from math import comb

MASTERS = (11, 22, 33)
KEYS = list(range(1, 10)) + [11, 22, 33]
Q = dict(zip(KEYS, (0.14, 0.03, 0.10, 0.04, 0.10, 0.05, 0.10, 0.10,
                    0.08, 0.16, 0.06, 0.04)))

def digit_sum(n):
    return sum(int(c) for c in str(n))

def rule_a(y, m, d):
    n = digit_sum(y) + digit_sum(m) + digit_sum(d)
    while n > 9 and n not in MASTERS:
        n = digit_sum(n)
    return n

def shares(y0=1950, y1=2009):
    c, n = {k: 0 for k in KEYS}, 0
    day, end = dt.date(y0, 1, 1), dt.date(y1, 12, 31)
    while day <= end:
        c[rule_a(day.year, day.month, day.day)] += 1
        n += 1
        day += dt.timedelta(days=1)
    return {k: v / n for k, v in c.items()}

def tail(n, k, p):
    return sum(comb(n, i) * p ** i * (1 - p) ** (n - i)
               for i in range(k, n + 1))

def plan(p0, p1, alpha=0.05, power=0.90):
    for n in range(20, 5000):
        k = next(k for k in range(n + 1) if tail(n, k, p0) <= alpha)
        if tail(n, k, p1) >= power:
            return n, k

if __name__ == "__main__":
    p = shares()
    chance_a = sum(p[k] * Q[k] for k in KEYS)
    print("   chance hit rate, nine descriptions, even base rates: {:.4f}"
          .format(1 / 9))
    print("   chance hit rate, twelve descriptions under rule A,")
    print("   with the example preferences q: {:.4f}".format(chance_a))
    print("   (twelve descriptions and even preferences would give {:.4f})"
          .format(sum(p[k] for k in KEYS) / 12))
    print("   example preferences q (numbers 1-9, 11, 22, 33):")
    cells = ["{}:{:.2f}".format(k, Q[k]) for k in KEYS]
    print("     " + " ".join(cells[:6]))
    print("     " + " ".join(cells[6:]))
    print("     sum of q = {:.2f}".format(sum(Q.values())))
    n, k = plan(1 / 9, 0.16)
    print("   nine descriptions, hit rate 0.16 against 1/9, one-sided"
          " 0.05,")
    print("   power 0.90: {} participants, at least {} hits".format(n, k))
    print("\nReading: with plain residues the chance level is exactly 1/9")
    print("and a pre-registered test needs a few hundred people. With")
    print("master numbers the chance level depends on which descriptions")
    print("people like, so it must be estimated by shuffling, not assumed.")

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《姓名笔画、生命灵数与手机号码的同余映射和分布论》第 8 章「四步核查与一项预注册的配对检验」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090178

DOI: 10.5281/zenodo.24090178 · 阅读本章所在专著 · 5DL-B-065 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026065,
  author    = {Fan, Yafu},
  title     = {Modular Numerology, Character-Stroke Hashes and Residue-Class Distributions},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.24090178},
  url       = {https://doi.org/10.5281/zenodo.24090178}
}

本书其他章节结论