关于「八十一数之二:从四十一到八十一」,《姓名数理、数字磁场与品牌改运命名母典》给出的定量结论是什么?
结论:上一章写完了 1 到 40,本章接着写 41 到 81。规则仍按收费站引擎:五格里任何一格算出来超过 81,就连续减 80,直到不大于 81 为止,所以原始总数 121 读作 41,161 读作 81;吉、半吉、凶三类也照抄引擎里的两张集合,不在集合里的一律算凶。部首怎样还原、五格怎样相加、这套读法从哪里来、可信度的边界在哪里,第一章已经交代清楚,这里只提醒一句:每一节的「结构」段是可以逐项核对的事实,其余各段是本书写给经营者的读法,没有被验证为预测。
数据口径:这些读法能否描述一个人、能否预示一门生意的成败,没有得到证实,本书也不主张;名字与数字通过念起来是否流畅、方言谐音与共同的文化偏好影响生意,这一部分有已发表的证据,本书当作真实机制来写,其余一律放进假说框并写明怎样证伪。 全部计算由书中程序生成;本书不是法律、投资或任何专业意见。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 与结论吻合的打印值: 161, 40, 41, 80, 81
| 1..40 | 40 numbers, good 23 (57.5%), half 4, bad 13 |
| 41..81 | 41 numbers, good 12 (29.3%), half 9, bad 20 |
| good numbers in 41..81 | 41 45 47 48 52 57 61 63 65 67 68 81 |
| half numbers in 41..81 | 49 51 55 58 71 73 75 77 78 |
| tail wood | 9 numbers, good 4, half 2, bad 3 |
| tail fire | 8 numbers, good 1, half 1, bad 6 |
| tail earth | 8 numbers, good 2, half 2, bad 4 |
| tail metal | 8 numbers, good 5, half 3, bad 0 |
| tail water | 8 numbers, good 0, half 1, bad 7 |
| n and n - 40 share a category for 19 of 40 pairs (47.5%) | |
| good below, not good above (n - 40 -> n), 15 pairs: | |
| 3 | 43 6->46 11->51 13->53 15->55 16->56 18->58 24->64 |
| 29 | 69 31->71 32->72 33->73 35->75 37->77 39->79 |
| raw totals 82..161: minus-80 and minus-81 disagree on 59 of 80 (73.8%) | |
| raw 82: minus-80 | 2 (bad), minus-81 -> 1 (good) |
| person-name bonus set inside 41..81 | 41 45 52 63 65 81 |
| brand-name bonus set inside 41..81 | 41 45 47 48 52 63 65 67 68 |
| longest run of bad numbers in 41..81 | 3 in a row, from 42 to 44 |
| gaps between good numbers in 41..81 | 4 2 1 4 5 4 2 2 2 1 13 |
查看完整验算程序
# Chapter 3. p31: the shape of the 41-81 table: categories, tail elements, the 81 cycle and its rivals.
# Categories are the engine's (fleet1_meta.JI = good, BAN = half, every other number = bad). The tail
# element is the engine's num_el: last digit 1,2 wood; 3,4 fire; 5,6 earth; 7,8 metal; 9,0 water.
# Reduction above 81: the engine subtracts 80 (82 -> 2, 161 -> 81). Some manuals subtract 81 instead
# (82 -> 1); the program counts how often the two rules disagree on the category of a raw total.
JI = {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}
BAN = {27, 30, 38, 40, 49, 51, 55, 58, 71, 73, 75, 77, 78}
EL = ["water", "wood", "wood", "fire", "fire", "earth", "earth", "metal", "metal", "water"]
PERSON_BONUS = {21, 23, 24, 31, 32, 33, 41, 45, 52, 63, 65, 81} # engine name_compute, person names
BRAND_BONUS = {24, 29, 31, 32, 33, 39, 41, 45, 47, 48, 52, 63, 65, 67, 68} # engine, brand names
def cat(n):
return "good" if n in JI else "half" if n in BAN else "bad"
def minus80(n):
while n > 81:
n -= 80
return n
def minus81(n):
while n > 81:
n -= 81
return n
low, high = range(1, 41), range(41, 82)
for name, rng in (("1..40", low), ("41..81", high)):
c = [cat(n) for n in rng]
print(" {:6s}: {} numbers, good {} ({:.1f}%), half {}, bad {}".format(
name, len(c), c.count("good"), 100 * c.count("good") / len(c), c.count("half"), c.count("bad")))
print(" good numbers in 41..81:", " ".join(str(n) for n in high if cat(n) == "good"))
print(" half numbers in 41..81:", " ".join(str(n) for n in high if cat(n) == "half"))
for e in ("wood", "fire", "earth", "metal", "water"):
ns = [n for n in high if EL[n % 10] == e]
print(" tail {:5s}: {} numbers, good {}, half {}, bad {}".format(
e, len(ns), sum(cat(n) == "good" for n in ns), sum(cat(n) == "half" for n in ns),
sum(cat(n) == "bad" for n in ns)))
same = sum(cat(n) == cat(n - 40) for n in range(41, 81))
print(" n and n - 40 share a category for {} of 40 pairs ({:.1f}%)".format(same, 100 * same / 40))
flips = [n for n in range(41, 81) if cat(n - 40) == "good" and cat(n) != "good"]
print(" good below, not good above (n - 40 -> n), {} pairs:".format(len(flips)))
print(" " + " ".join("{}->{}".format(n - 40, n) for n in flips[:8]))
print(" " + " ".join("{}->{}".format(n - 40, n) for n in flips[8:]))
diff = [t for t in range(82, 162) if cat(minus80(t)) != cat(minus81(t))]
print(" raw totals 82..161: minus-80 and minus-81 disagree on {} of 80 ({:.1f}%)".format(
len(diff), 100 * len(diff) / 80))
print(" raw 82: minus-80 -> {} ({}), minus-81 -> {} ({})".format(
minus80(82), cat(minus80(82)), minus81(82), cat(minus81(82))))
print(" person-name bonus set inside 41..81:", " ".join(str(n) for n in high if n in PERSON_BONUS))
print(" brand-name bonus set inside 41..81: ", " ".join(str(n) for n in high if n in BRAND_BONUS))
run, best, start = 0, (0, 0), 0
for n in high:
if cat(n) == "bad":
run += 1
if run > best[0]:
best = (run, n - run + 1)
else:
run = 0
print(" longest run of bad numbers in 41..81: {} in a row, from {} to {}".format(
best[0], best[1], best[1] + best[0] - 1))
gaps = [b - a for a, b in zip(sorted(n for n in high if cat(n) == "good"),
sorted(n for n in high if cat(n) == "good")[1:])]
print(" gaps between good numbers in 41..81:", " ".join(str(g) for g in gaps))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《姓名数理、数字磁场与品牌改运命名母典》第 3 章「八十一数之二:从四十一到八十一」(版本 0.1.0). 5D Library. DOI 待发布
DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-127 · v0.1.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026127,
author = {Fan, Yafu},
title = {The Name-Number, Digit-Field and Brand-Naming Codex},
year = {2026},
publisher = {5D Library},
edition = {0.1.0},
note = {DOI pending}
}