New Mersenne Prime discovered (probably)
GIMPS, operational since 1996, is verifying a potential new Mersenne prime, the first in six years. The latest software version enhances testing efficiency, and cash awards incentivize participation.
Read original article
The Great Internet Mersenne Prime Search (GIMPS) is a collaborative project that has been operational since 1996, focusing on the discovery of Mersenne prime numbers. Recently, a GIMPS computer reported a successful Fermat probable prime test, suggesting the discovery of a new Mersenne prime, which would be the first in nearly six years. This result is currently undergoing verification through multiple Lucas-Lehmer tests to confirm its primality. GIMPS has made significant advancements in its software, with the latest version, Prime95 version 30.19, enhancing the efficiency of certain testing stages. The project has a history of successful discoveries, including the largest known prime number found in 2018, and has a dedicated community of volunteers who contribute their computing power to the search. GIMPS offers cash awards for new prime discoveries, incentivizing participation. The project continues to evolve, with ongoing improvements in testing methods and software to increase the likelihood of finding new primes.
- GIMPS is a volunteer-driven project searching for Mersenne primes since 1996.
- A new Mersenne prime discovery is under verification, potentially marking the first in six years.
- The latest software version, Prime95 30.19, improves testing efficiency.
- GIMPS has discovered the largest known prime number in 2018.
- Cash awards are offered for discovering new Mersenne primes, encouraging participation.
Related
The Biggest Problem in Mathematics Is Finally a Step Closer to Being Solved
Mathematicians Larry Guth and James Maynard made progress on the Riemann Hypothesis, a key problem in prime number distribution. Their work offers insights and techniques for potential breakthroughs in mathematics.
What Is the Riemann Hypothesis and Why Do People Want to Solve It
The Riemann Hypothesis, a century-old unsolved problem in mathematics, involves complex analysis and prime numbers' distribution along the number line, attracting global attention for its implications and challenges to mathematicians.
'Sensational' Proof Delivers New Insights into Prime Numbers
Mathematicians James Maynard and Larry Guth set new limits on exceptions to the Riemann hypothesis, improving prime number approximations. Their innovative approach highlights interdisciplinary collaboration's importance in solving mathematical problems.
What is the longest known sequence that repeats in Pi? (homelab)
The article explores repeating sequences in Pi's decimal representation, detailing the transition from Python to C for efficiency, successful identification of sequences, and plans for further extensive searches.
Big Advance on Simple-Sounding Math Problem Was a Century in the Making
Hector Pasten, a Chilean mathematician, advanced number theory by proving that the sequence n² + 1 always contains a large prime factor, impacting the abc conjecture and improving 1930s results.
- Many users express enthusiasm for the GIMPS project and its potential discoveries.
- Questions arise regarding the efficiency and scale of GIMPS compared to traditional computing resources.
- Some commenters seek clarification on the significance of discovering new Mersenne primes.
- There are discussions about the technical aspects of prime testing and potential improvements.
- Humor and light-hearted remarks are present, showcasing a community engaged in a niche interest.
20 commentsI use to run Mersenne Prime Search (GIMPS), but now all I have is laptops. It runs to hot on the Laptops I have :(
Will need to play with throttling some more.
Edit: found mprime (mprime-bin-24.14) is available in NetBSD pkgsrc. But this uses 32 bit linux emulation to execute, I have been trying to avoid it, but may try it.
It’s the longest wait for a new mersenne prime since the discovery of M32 in 1992.
I’d like it to be astronomical, but given the niche of this, and the low cost of cloud compute, the answer is predicable depressing, like, “$50k/year in AWS costs would equal current GIMPS search throughput”
M = 2ⁿ - 1
Related
The Biggest Problem in Mathematics Is Finally a Step Closer to Being Solved
Mathematicians Larry Guth and James Maynard made progress on the Riemann Hypothesis, a key problem in prime number distribution. Their work offers insights and techniques for potential breakthroughs in mathematics.
What Is the Riemann Hypothesis and Why Do People Want to Solve It
The Riemann Hypothesis, a century-old unsolved problem in mathematics, involves complex analysis and prime numbers' distribution along the number line, attracting global attention for its implications and challenges to mathematicians.
'Sensational' Proof Delivers New Insights into Prime Numbers
Mathematicians James Maynard and Larry Guth set new limits on exceptions to the Riemann hypothesis, improving prime number approximations. Their innovative approach highlights interdisciplinary collaboration's importance in solving mathematical problems.
What is the longest known sequence that repeats in Pi? (homelab)
The article explores repeating sequences in Pi's decimal representation, detailing the transition from Python to C for efficiency, successful identification of sequences, and plans for further extensive searches.
Big Advance on Simple-Sounding Math Problem Was a Century in the Making
Hector Pasten, a Chilean mathematician, advanced number theory by proving that the sequence n² + 1 always contains a large prime factor, impacting the abc conjecture and improving 1930s results.