关于「拉马努金式猜想流水线:高产生成、穷举证伪与精确定界」,《量子启发与猜想证伪》给出的定量结论是什么?

结论:第六章搭建拉马努金式猜想流水线:模板生成的欧拉式候选证伪率 0.9970;Pólya 猜想在小范围内毫发无损,最小反例却在 906,150,257。

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

English version

对照数据表

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

A. x^2 + x + c, c2 to 2,000: 1,999 candidates
refuted 1,993, survivors 6 -> c in [2, 3, 5, 11, 17, 41]
refutation rate 1993/19990.9970; median first failing x = 0
B. a x^2 + b x + c grid7,560 candidates
prime for x < 1065; still prime for x < 40: 5
share of x<10 survivors killed by x<400.923
survivors that are x^2 + x + 41 shifted by s5 of 5, s = [0, 1, 2, 3, 4]
C. first n with sum of 1/k^2 (k1 to n) >= 1.64: n = 203
partial sum1.640020072; limit pi^2/6 = 1.644934067
查看完整验算程序
# Chapter 6. p63: a generate, refute, bound pipeline with a ledger.
# Family A: "x^2 + x + c is prime for every x from 0 to c - 2", c from 2
# to 2,000 (Euler-type candidates). Family B: "a x^2 + b x + c is prime
# for x = 0 to 9" over a small grid, then the survivors are re-tested on
# x = 0 to 39. Part C bounds a false inequality exactly with Fraction:
# "the sum of 1/k^2 for k = 1 to n stays below 1.64" fails, and exact
# arithmetic gives the first failing n. Refutation rates are exact
# fractions. All candidates are generated by template, not by insight.
from fractions import Fraction
import math
import statistics


def is_prime(n):
    if n < 2:
        return False
    if n % 2 == 0:
        return n == 2
    for p in range(3, math.isqrt(n) + 1, 2):
        if n % p == 0:
            return False
    return True


def first_fail(f, xs):
    for x in xs:
        if not is_prime(f(x)):
            return x
    return None


if __name__ == "__main__":
    fails, alive = [], []
    for c in range(2, 2001):
        x = first_fail(lambda t: t * t + t + c, range(0, c - 1))
        if x is None:
            alive.append(c)
        else:
            fails.append(x)
    tried = len(fails) + len(alive)
    rate = Fraction(len(fails), tried)
    print("A. x^2 + x + c, c = 2 to 2,000: {:,} candidates".format(tried))
    print("   refuted {:,}, survivors {} -> c in {}".format(
        len(fails), len(alive), alive))
    print("   refutation rate {} = {:.4f}; median first failing x = {}"
          .format(rate, float(rate), statistics.median(fails)))
    grid = [(a, b, c) for a in range(1, 7) for b in range(-10, 11)
            for c in range(1, 61)]
    s10 = [g for g in grid if first_fail(
        lambda t, g=g: g[0] * t * t + g[1] * t + g[2], range(10)) is None]
    s40 = [g for g in s10 if first_fail(
        lambda t, g=g: g[0] * t * t + g[1] * t + g[2], range(40)) is None]
    print("B. a x^2 + b x + c grid: {:,} candidates".format(len(grid)))
    print("   prime for x < 10: {}; still prime for x < 40: {}".format(
        len(s10), len(s40)))
    print("   share of x<10 survivors killed by x<40: {:.3f}".format(
        1 - len(s40) / len(s10)))
    shifts = []
    for a, b, c in s40:
        sh = Fraction(1 - b, 2)
        if a == 1 and sh.denominator == 1 and c == sh * sh - sh + 41:
            shifts.append(int(sh))
    print("   survivors that are x^2 + x + 41 shifted by s: {} of {}, s = {}"
          .format(len(shifts), len(s40), sorted(shifts)))
    total, n = Fraction(0), 0
    bound = Fraction(164, 100)
    while total < bound:
        n += 1
        total += Fraction(1, n * n)
    print("C. first n with sum of 1/k^2 (k = 1 to n) >= 1.64: n = {}"
          .format(n))
    print("   partial sum = {:.9f}; limit pi^2/6 = {:.9f}".format(
        float(total), math.pi ** 2 / 6))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《量子启发式组合寻优、拉马努金式直觉猜想与突破性著作推演母典》第 6 章「拉马努金式猜想流水线:高产生成、穷举证伪与精确定界」(版本 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}
}

本书其他章节结论