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

This paper proposes the Wright-Euler Mersenne Exponent Hypothesis, which utilizes Euler's quadratic polynomial $C(n) = n^2 + n + 41$ combined with nearest-integer rounding to identify candidate exponents for Mersenne primes, demonstrating a significantly higher accuracy and lower error rate compared to exponential regression models while effectively narrowing the search space for GIMPS testing.

The Gist

Imagine you are looking for a specific type of rare, glowing treasure hidden in a vast, dark ocean. In the world of mathematics, this treasure is called a Mersenne Prime. These are special numbers (like $2^{13} - 1$) that are incredibly hard to find because they are so huge and rare. For centuries, mathematicians have been fishing for them, mostly by casting a very wide net and hoping to catch something.

This paper, written by John K. Wright V, proposes a new, clever way to fish. Instead of casting a wide net, he suggests using a specialized metal detector based on an old, famous formula.

Here is the breakdown of the paper in simple terms:

1. The Old Treasure Map (Euler's Formula)

Back in the 1700s, a mathematician named Euler discovered a magic formula: $n^2 + n + 41$.
If you plug in small whole numbers for $n$ (like 1, 2, 3...), this formula spits out prime numbers almost every time. It's like a machine that reliably produces gold coins. However, for a long time, nobody thought this machine could help find Mersenne Primes.

2. The New Idea: The "Rounding" Trick

The author, Wright, had a "Eureka!" moment. He asked: What if we run the Mersenne Primes we already know through this machine in reverse?

Imagine you have a target number (a known Mersenne Prime exponent, like 1,257,787). You plug it into the machine to see what "input number" ($n$) would have created it.

• The Problem: The machine gives you a messy decimal number (like 1120.993).
• The Trick: Wright says, "Don't worry about the messy decimal! Just round it to the nearest whole number."

So, 1120.993 becomes 1121. When you plug 1121 back into the formula, you get a number that is incredibly close to the original Mersenne Prime.

3. The Results: A Better Compass

Wright tested this idea on the 43 known Mersenne Primes (the ones we've already found).

• The Old Way (Exponential Growth): If you try to guess where the next prime is by just drawing a smooth curve through the past ones, you are wildly off. It's like trying to guess the location of a specific house in a city by only knowing the city's average population density. The error is huge (millions of digits off).
• The Wright-Euler Way: By using the rounding trick, the author found 7 perfect matches and 4 very close guesses out of the 43 known primes.
  • Analogy: If the old method was like guessing a PIN code with a blindfold, this new method is like having a map that points you to the right street, and you only have to check a few houses on that street.

4. Why This Matters: Saving Time and Money

Finding these primes is expensive. It requires supercomputers running for months (a project called GIMPS).

• The Search Space: Currently, computers have to check billions of numbers.
• The Shortcut: Wright's method suggests that we only need to check numbers generated by his formula where the "rounding error" is tiny (less than 0.1).
• The Impact: This cuts the search area by 74%. It's like telling the treasure hunters, "Stop searching the whole ocean. We know the treasure is in this one specific bay. Let's focus there."

5. The Proposed New Targets

Based on this logic, the author has identified 5 new candidate numbers (exponents) that are likely to be the next Mersenne Primes. He is suggesting that the supercomputers at GIMPS test these specific numbers first.

Summary Analogy

Think of finding Mersenne Primes like trying to find a specific needle in a haystack.

• The Old Method: You shake the whole haystack and hope the needle falls out.
• The Wright-Euler Method: You use a magnet (Euler's formula) to pull out a small pile of hay that is most likely to contain the needle. You then check that small pile first.

The Bottom Line: The paper argues that an old math formula, combined with a simple "rounding" trick, is a surprisingly powerful tool for predicting where the next giant prime numbers are hiding, potentially saving years of computer time.

Technical Summary

Based on the provided manuscript, here is a detailed technical summary of the paper "Predicting Mersenne Prime Exponents Using Euler's Quadratic Polynomial C(n) = n² + n + 41 with Nearest-Integer Rounding" by JohnK Wright V.

1. Problem Statement

Mersenne primes, defined as numbers of the form $M_p = 2^p - 1$, are central to number theory and the search for perfect numbers. As of October 2025, 52 Mersenne primes are known, with their exponents ($p$) exhibiting rapid exponential growth. Despite extensive computational efforts (e.g., by GIMPS), there is no known deterministic formula or efficient heuristic to predict the specific exponents $p$ that yield Mersenne primes. The primary challenge is the vastness of the search space, which makes brute-force testing computationally prohibitive.

2. Methodology: The Wright-Euler Hypothesis

The paper introduces the Wright-Euler Mersenne Exponent Hypothesis, which leverages Euler's famous prime-generating polynomial:
$$C(n) = n^2 + n + 41$$

The methodology involves an inverse mapping process to identify candidate exponents:

1. Inverse Calculation: For a known Mersenne exponent $p$, the paper solves the quadratic equation $n^2 + n + (41 - p) = 0$ for $n$.
2. Root Selection: The positive root is selected:
   $$n = \frac{-1 + \sqrt{4p - 163}}{2}$$
3. Nearest-Integer Rounding: Instead of requiring $n$ to be an integer, the method applies nearest-integer rounding to define $n_{closest} = \text{round}(n)$.
4. Candidate Generation: The predicted exponent is calculated as $p_{pred} = C(n_{closest})$.
5. Deviation Metric: The method prioritizes cases where the deviation $d = |n - n_{closest}|$ is small (specifically $d < 0.1$), hypothesizing that these represent the strongest candidates for new Mersenne primes.

3. Key Contributions

• Novel Heuristic Application: This is the first known work applying Euler's quadratic polynomial with nearest-integer rounding specifically to the prediction of Mersenne prime exponents.
• Comparative Analysis: The study rigorously compares the Wright-Euler model against:
  • An exponential regression model ($y = 11111.14 \cdot e^{0.1787x}$).
  • Other quadratic polynomials ($n^2 + 1$ and $n^2 + n + 17$).
• Search Space Reduction: The paper proposes a heuristic algorithm to filter the search space for the Great Internet Mersenne Prime Search (GIMPS), specifically targeting the 140M–200M range.

4. Results

The hypothesis was tested against 43 known Mersenne prime exponents (indices $x = 10$ to $52$, excluding$p \leq 31$).

• Accuracy:
  • Exact Matches: 7 cases where $C(n_{closest})$ exactly equals the known Mersenne exponent.
  • Close Approximations: 4 cases where the predicted value is very close to the actual exponent.
  • Success Rate: Approximately 25.6% (11 out of 43) for the tested range.
• Error Metrics (Range $x=30$ to $52$):
  • Wright-Euler Model: Mean Absolute Error (MAE) $\approx 614.0$.
  • Exponential Model: MAE $\approx 10,466,686$ (with $R^2 \approx 0.974$ but zero exact matches).
  • Other Quadratics: $n^2+1$ and $n^2+n+17$ yielded MAEs of ~1956 and ~1170 respectively, with no exact matches in the tested subset.
• Specific Examples:
  • Index $x=34$ ($p=1,257,787$): $n \approx 1120.993$, $n_{closest}=1121$, $C(1121) = 1,257,803$ (Error: 16).
  • Index $x=38$ ($p=6,972,593$): Exact match.
  • Index $x=52$ ($p=136,279,841$): Exact match.

5. Significance and Implications

• Structural Alignment: The results suggest a unique structural alignment between Euler's polynomial and the distribution of Mersenne prime exponents, beyond what is explained by simple prime density.
• Efficiency Gains: By prioritizing candidates where the deviation $d < 0.1$, the method reduces the effective search space for GIMPS by approximately 74%.
• Future Candidates: From an analysis of 560 unique candidates, the authors identified 5 prime values of $C(n)$ (indices 53–57) with $d < 0.1$ (or acceptable range) for targeted testing. These include:
  • $n=15477 \rightarrow p \approx 239,553,049$ ($d=0.019$)
  • $n=14861 \rightarrow p \approx 220,864,223$ ($d=0.021$)
• Practical Application: The paper provides a concrete, computationally cheap heuristic to guide the allocation of massive computational resources (GIMPS) toward the most statistically probable ranges for the next Mersenne primes.

Conclusion

The Wright-Euler Mersenne Exponent Hypothesis demonstrates that Euler's quadratic polynomial, when combined with nearest-integer rounding, offers a significantly more precise predictor for Mersenne prime exponents than standard exponential regression or alternative quadratic forms. While not a deterministic proof, it serves as a powerful heuristic tool that could accelerate the discovery of future Mersenne primes by narrowing the search domain.