关于「称骨下半程:四两七钱到七两二钱」,《交界校时、双胞胎与称骨纳音》给出的定量结论是什么?
结论:本章读了称骨表较重的二十六个重量,从四两七钱到七两二钱。精确枚举表明:五两及以上占 18.06%,六两及以上只占 1.64%,共 4244 种组合;最重只能称到七两一钱,16 种组合,七两二钱在这套表里不存在,歌诀与数表的边界并未对齐。重的一端由四个部分轮流推动,到六两以上,靠的是一个重年(己卯、戊午等十个年份)加上子、巳两个十六钱的重时辰;六两六钱以上的组合全部出生在子时或巳时。因此重格对校时最敏感:0.837 的六两以上组合只差一个时辰就会跌出系统档。每一格按古歌大意、结构、抗压底盘与财富承载力四段写完,重格的读法着重于它在顺境里如何越过边界;本章给出了一项可以预先登记的检验与所需的样本量。
数据口径:出生时刻离时辰交界很近、或者根本说不准的人,该用哪一张盘?本卷把这个问题写成一套可以计算的程序:先把钟面时间经过经度修正与时差换成真太阳时,量出它离最近交界的分钟数与记录误差,再用三件可以查证的往事合成一个似然比,后验到 0.90 才定盘,到不了就写「未定」。 本书不主张任何占验:它精确写出规则、精确计算结构,并说明怎样检验读法本身;全部计算由书中程序生成;本书不是医疗、心理、法律或投资建议。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 1.64, 16, 18.06, 4244
| cases 259200 | heaviest reachable 71 | |||
| weight | cases | share% | one-in | at-or-above% |
| 47 | 11194 | 4.319 | 23 | 30.528 |
| 48 | 11216 | 4.327 | 23 | 26.209 |
| 49 | 9907 | 3.822 | 26 | 21.882 |
| 50 | 7735 | 2.984 | 34 | 18.060 |
| 51 | 6490 | 2.504 | 40 | 15.076 |
| 52 | 5466 | 2.109 | 47 | 12.572 |
| 53 | 4518 | 1.743 | 57 | 10.463 |
| 54 | 4232 | 1.633 | 61 | 8.720 |
| 55 | 4054 | 1.564 | 64 | 7.087 |
| 56 | 3476 | 1.341 | 75 | 5.523 |
| 57 | 2684 | 1.035 | 97 | 4.182 |
| 58 | 2262 | 0.873 | 115 | 3.147 |
| 59 | 1650 | 0.637 | 157 | 2.274 |
| 60 | 1064 | 0.410 | 244 | 1.637 |
| 61 | 888 | 0.343 | 292 | 1.227 |
| 62 | 660 | 0.255 | 393 | 0.884 |
| 63 | 468 | 0.181 | 554 | 0.630 |
| 64 | 368 | 0.142 | 704 | 0.449 |
| 65 | 292 | 0.113 | 888 | 0.307 |
| 66 | 212 | 0.082 | 1223 | 0.194 |
| 67 | 116 | 0.045 | 2234 | 0.113 |
| 68 | 96 | 0.037 | 2700 | 0.068 |
| 69 | 48 | 0.019 | 5400 | 0.031 |
| 70 | 16 | 0.006 | 16200 | 0.012 |
| 71 | 16 | 0.006 | 16200 | 0.006 |
| 72 | 0 | 0.000 | 0 | 0.000 |
查看完整验算程序
# Chapter 6. p30: Exact census of bone weights 47 to 72 qian.
# Same rule and tables as chapter 5: year (sixty-year cycle) + lunar month +
# lunar day (1-30) + double hour, in qian; all 60 x 12 x 30 x 12 = 259200
# combinations counted once. For each weight of this chapter: cases, share in
# percent, "one in" (cases per hit, rounded; 0 when the weight never occurs)
# and the cumulative share at or above that weight. Then the ceiling: the sum
# of the four largest table values, and how many ways reach it.
from collections import Counter
YEAR = [12, 9, 6, 7, 12, 5, 9, 8, 7, 8, 15, 9, 16, 8, 8, 19, 12, 6, 8, 7,
5, 15, 6, 16, 15, 7, 9, 12, 10, 7, 15, 6, 5, 14, 14, 9, 7, 7, 9, 12,
8, 7, 13, 5, 14, 5, 9, 17, 5, 7, 12, 8, 8, 6, 19, 6, 8, 16, 10, 6]
MONTH = [16, 9, 15, 18, 9, 15, 9, 15, 18, 8, 9, 5]
DAY = [5, 10, 8, 15, 16, 15, 8, 16, 8, 16, 9, 17, 8, 17, 10, 8, 9, 18, 5, 15,
10, 9, 8, 9, 15, 18, 7, 8, 16, 6]
HOUR = [16, 6, 7, 10, 9, 16, 10, 8, 8, 9, 6, 6]
TABLES = (YEAR, MONTH, DAY, HOUR)
def census():
c = Counter()
for y in YEAR:
for m in MONTH:
for d in DAY:
for h in HOUR:
c[y + m + d + h] += 1
return c
if __name__ == "__main__":
c = census()
n = sum(c.values())
print(" cases {} heaviest reachable {}".format(n, max(c)))
print(" weight cases share% one-in at-or-above%")
for w in range(47, 73):
above = sum(k for v, k in c.items() if v >= w)
print(" {:5d} {:8d} {:7.3f} {:7d} {:12.3f}".format(
w, c[w], 100 * c[w] / n, round(n / c[w]) if c[w] else 0, 100 * above / n))
top = [max(t) for t in TABLES]
ways = 1
for t, x in zip(TABLES, top):
ways *= t.count(x)
print(" ceiling = {} + {} + {} + {} = {} qian, reached by {} cases".format(*top, sum(top), ways))
for cut in (50, 60):
k = sum(v for w, v in c.items() if w >= cut)
print(" {} and above: {} cases ({:.2f}%)".format(cut, k, 100 * k / n))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《交界时辰反推校时、双胞胎分盘与六十纳音称骨定盘母典》第 6 章「称骨下半程:四两七钱到七两二钱」(版本 1.0.0). 5D Library. DOI 待发布
DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-124 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026124,
author = {Fan, Yafu},
title = {The Boundary-Hour Rectification, Twin-Chart and Bone-Weight Baseload Codex},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}