关于「手机号码:模 80、异或与被压缩的号码」,《数字命理的模算术》给出的定量结论是什么?
结论:第六章说明手机号码模 80 只读后四位,因为 10,000 是 80 的倍数,吉号基率为 0.425;「八星」是三位二进制的异或,吉凶只是两个数字是否同属东四或西四的一位信息,没有凶对的八位尾号只占 0.0336 到 0.0894。
数据口径:书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的假说。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.425, 80
10 000 mod 80 = 0; 10^8 mod 80 = 0
100,000 random 11-digit numbers: whole number, last 8 and last 4
digits give the same number every time: True
last four digits 0000-9999: each of the 80 numbers occurs {125} times
good numbers reachable: 34 of 80, so the base rate of a 'good'
number among evenly spread numbers is 0.425
adding one to the last four digits flips the label in 0.550 of cases
Reading: the rule reads only the last four digits; with those
evenly spread, a 'good' number is drawn with probability 0.425,
and moving to the next number changes the verdict about half the
time.查看完整验算程序
# Chapter 6. Phone numbers modulo 80.
# The rule: divide the number (or its last four, or last eight, digits)
# by 80, take the remainder r (r = 0 counts as 80), and look r up in the
# 81-number list. Because 10 000 = 125 x 80, a number's remainder modulo
# 80 is decided by its last four digits alone, so all three versions of
# the rule agree. By the Chinese remainder theorem, 80 = 16 x 5: the last
# digit fixes the residue mod 5, the last four fix it mod 16.
import random
GOOD = {1, 3, 5, 6, 7, 8, 11, 13, 15, 16, 17, 18, 21, 23, 24, 25, 29,
31, 32, 33, 35, 37, 39, 41, 45, 47, 48, 52, 57, 61, 63, 65, 67,
68, 81}
def number80(n):
r = n % 80
return 80 if r == 0 else r
if __name__ == "__main__":
print(" 10 000 mod 80 = {}; 10^8 mod 80 = {}".format(10000 % 80,
10 ** 8 % 80))
rng = random.Random(80)
agree = 0
for _ in range(100000):
n = rng.randrange(10 ** 10, 2 * 10 ** 10)
a, b, c = number80(n), number80(n % 10 ** 4), number80(n % 10 ** 8)
agree += a == b == c
print(" 100,000 random 11-digit numbers: whole number, last 8 and last"
" 4")
print(" digits give the same number every time: {}".format(
agree == 100000))
hits = {}
for t in range(10000):
k = number80(t)
hits[k] = hits.get(k, 0) + 1
print(" last four digits 0000-9999: each of the 80 numbers occurs {}"
" times".format(set(hits.values())))
good = sum(1 for k in range(1, 81) if k in GOOD)
print(" good numbers reachable: {} of 80, so the base rate of a 'good'"
.format(good))
print(" number among evenly spread numbers is {:.3f}".format(good / 80))
moved = sum((number80(t) in GOOD) != (number80(t + 1) in GOOD)
for t in range(9999))
print(" adding one to the last four digits flips the label in {:.3f}"
" of cases".format(moved / 9999))
print("\nReading: the rule reads only the last four digits; with those")
print("evenly spread, a 'good' number is drawn with probability 0.425,")
print("and moving to the next number changes the verdict about half the")
print("time.")唯一数据源与引用
范雅福(Fan, Y.). (2026). 《姓名笔画、生命灵数与手机号码的同余映射和分布论》第 6 章「手机号码:模 80、异或与被压缩的号码」(版本 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}
}