利用欧拉二次多项式C(n) = n² + n + 41与最近整数取整预测梅森素数指数
Predicting Mersenne Prime Exponents Using Euler's Quadratic Polynomial C(n) = n^2 + n + 41 with Nearest-Integer Rounding
AI总结:
利用欧拉二次多项式与最近整数取整预测梅森素数指数,取得较高精度并缩小搜索空间。
摘要:
怀特-欧拉梅森指数假说提出,将欧拉的二次多项式C(n) = n² + n + 41与最近整数取整n_closest = round((-1 + sqrt(4p - 163))/2)结合,可识别梅森素数2^p - 1的指数候选者。应用于已知的43个梅森素数指数,其中x从10到52(排除p ≤ 31),该方法产生7个精确匹配(成功率为16.3%,例如x = 38,p = 6972593;x = 52,p = 136279841)和4个接近的近似值(例如x = 34,p = 1257787,C(1121) = 1257803),在x = 30到52范围内,均绝对误差约为614。相比之下,指数回归模型y = 11111.14 e^{0.1787x}捕捉到整体增长趋势(R²约0.974),但没有精确匹配,均绝对误差为10,466,686。图形分析,包括C(n_closest)与实际指数及绝对偏差d = |n - n_closest|的散点图,展示了应用最近整数取整时该假说的精度。从约50个C(n)的素数值中识别出560个唯一候选者中,选取5个d < 0.1的案例进行定向GIMPS测试,将有效搜索空间减少约74%。
英文摘要:
The Wright-Euler Mersenne Exponent Hypothesis proposes that Euler's quadratic polynomial C(n) = n^2 + n + 41, combined with nearest-integer rounding n_closest = round((-1 + sqrt(4p - 163))/2), identifies candidate exponents for Mersenne primes 2^p - 1. Applied to the 43 known Mersenne prime exponents with indices x = 10 through 52 (excluding p <= 31), the method produces seven exact matches (a 16.3% success rate, e.g., x = 38, p = 6972593 and x = 52, p = 136279841) and four close approximations (e.g., x = 34, p = 1257787, C(1121) = 1257803), with a mean absolute error of approximately 614 over the range x = 30 to 52. By comparison, an exponential regression model y = 11111.14 e^{0.1787x} captures the overall growth trend (R^2 approx 0.974) but yields no exact matches and a mean absolute error of 10,466,686. Graphical analysis, including scatter plots of C(n_closest) versus actual exponents and absolute deviations d = |n - n_closest|, demonstrates the hypothesis's precision when nearest-integer rounding is applied. From approximately 50 prime values of C(n) identified among 560 unique candidates, five cases with d < 0.1 are selected for targeted GIMPS testing, reducing the effective search space by approximately 74%.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。