关于「依乎天理与溯因:庖丁、沈括、皮尔士与哈代」,《量子启发与猜想证伪》给出的定量结论是什么?

结论:第七章考辨《庄子》庖丁解牛、沈括隙积术、皮尔士的溯因与哈代的一句话,沈括的修正公式在 27,000 个堆上逐一核对。

数据口径:书中参数为示意,全部计算由书中程序生成。 本书不构成投资、学术评审或量子硬件方面的建议。

English version

对照数据表

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

top a x blayersbrutefrustumShenexcess
1 x 12514/351/3
2 x 346866682
3 x 562652602655
4 x 41080579080515
10 x 1281,7165120/31,71628/3
5 x 92510,22510,12510,225100
exhaustive check a, b, n in 1 to 30: 27,000 piles, 0 mismatches
查看完整验算程序
# Chapter 7. p71: Shen Kuo's stacked-jar count against the solid formula.
# Mengxi Bitan, juan 18: a pile of jars whose top layer is a by b and
# whose bottom layer is c by d, with n layers (c = a + n - 1,
# d = b + n - 1). Brute force counts every jar layer by layer. The
# continuous frustum ("chu tong") volume n/6 [(2b + d) a + (2d + b) c]
# undercounts; Shen Kuo adds the excess n (c - a) / 6. Exact Fraction
# arithmetic; the pile sizes are illustrative.
from fractions import Fraction


def brute(a, b, n):
    count = 0
    for i in range(n):
        count += (a + i) * (b + i)
    return count


def frustum(a, b, n):
    c, d = a + n - 1, b + n - 1
    return Fraction(n, 6) * ((2 * b + d) * a + (2 * d + b) * c)


def shen(a, b, n):
    c = a + n - 1
    return frustum(a, b, n) + Fraction(n * (c - a), 6)


def show(x):
    return "{:,}".format(int(x)) if x.denominator == 1 else str(x)


if __name__ == "__main__":
    print("  top a x b  layers   brute   frustum     Shen    excess")
    for a, b, n in ((1, 1, 2), (2, 3, 4), (3, 5, 6), (4, 4, 10),
                    (10, 12, 8), (5, 9, 25)):
        br, fr, sh = brute(a, b, n), frustum(a, b, n), shen(a, b, n)
        print("  {:>4} x {:<3} {:>5}  {:>7,} {:>9}  {:>7,}  {:>7}".format(
            a, b, n, br, show(fr), int(sh), show(sh - fr)))
        assert sh == br
    bad = 0
    for a in range(1, 31):
        for b in range(1, 31):
            for n in range(1, 31):
                if shen(a, b, n) != brute(a, b, n):
                    bad += 1
    print("  exhaustive check a, b, n in 1 to 30: {:,} piles, {} mismatches"
          .format(30 ** 3, bad))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《量子启发式组合寻优、拉马努金式直觉猜想与突破性著作推演母典》第 7 章「依乎天理与溯因:庖丁、沈括、皮尔士与哈代」(版本 1.0.0). 5D Library. DOI 待发布

DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-364 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026364,
  author    = {Fan, Yafu},
  title     = {Quantum-Inspired Combinatorial Search, Abductive Intuition and Computationally Verified Breakthrough Monograph Engineering},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论