Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2603.06579

Predicting Mersenne Prime Exponents Using Euler's Quadratic Polynomial C(n) = n^2 + n + 41 with Nearest-Integer Rounding

JohnK Wright V
View original source ↗Read source document ↗Export metadata ↓

Abstract

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%.

Explore related subjects

math.GM

Keep this discovery

BibTeXRIS

JohnK Wright V. 2025-12-17. Predicting Mersenne Prime Exponents Using Euler's Quadratic Polynomial C(n) = n^2 + n + 41 with Nearest-Integer Rounding. https://doi.org/10.13140/rg.2.2.21565.12004

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Average Chord Lengths in a Triangle

Let $P$ be a point inside a triangle $T$. We consider the average length of the chords of $T$ through $P$, where the direction of the chord is chosen uniformly. An elementary formula is obtained in terms of the distances from $P$ to the sides and vertices of the triangle. Several classical triangle centers give especially simple specializations. For example, if $I$ is the incenter, then \[ M_T(I)=\frac{2r}{\pi} \log\left(\cot\frac A4\cot\frac B4\cot\frac C4\right). \] Our main result is the sharp inequality \[ M_T(P)\le \frac{p}{\pi\sqrt3}\log(2+\sqrt3), \] valid simultaneously for every triangle of perimeter $p$ and every interior point $P$. Thus, among all such pairs $(T,P)$, the largest possible average chord length occurs only when $T$ is equilateral and $P$ is its center. The proof is an elementary symmetrization argument. We close with brief remarks relating the problem to the radial center of a convex body, the electrostatic potential center of a triangle, and dual quermassintegrals.

math.GM↗
arXiv2026

A Proof of Liu's Conjecture on the Fundamental Triangle Inequality

Let $a,b,c$ be the side lengths of a triangle, and let $R$ and $r$ denote its circumradius and inradius, respectively. We prove a conjecture of Liu stating that \[\sum_{\mathrm{cyc}} \left(\frac{a(b+c-a)}{bc}\right)^k \geq 2+\left(\frac{2r}{R}\right)^k,~~k>1, \] with the reverse inequality for $0<k<1$. The proof reduces the problem to three positive variables with fixed sum and product. We also determine the equality cases.

math.GM↗