Largest Mersenne Prime Discovered |

Written by Mike James |

Wednesday, 20 January 2016 |

We now know that 2^74,207,281-1 is a prime and this is not only the largest prime of this form, a Mersenne prime, but the largest prime of any sort. Is this a discovery? After all, the number has been there all the time and it was always prime or it wasn't. Why do we do this? If you think that the energy and computing power wasted on the Bitcoin is bad enough, you probably aren't going to like the idea of huge amounts of computing power being poured into discovering if a number is prime or not. The trouble is, if I'm being honest, I can't do much to convince you that the two things are very different. The Great Internet Mersenne Prime Search (GIMPS) was formed in January 1996 with the purpose of finding Mersenne primes. A Mersenne prime is of the form 2 It is also worth noting that, from a programming point of view, Mersenne primes are very simple. For example, in binary the first three are 11, 111, 11111 and so on. In general 2 According to the announcement of the new prime:
The primality proof took 31 days of non-stop computing on a PC with an Intel I7-4790 CPU on a university computer volunteered by Curtis Cooper for the project. The new prime has 22,338,618 digits and is the 49th Mersenne prime to be discovered and the fourth discovered by Curtis Cooper and eligible for the $3,000 GIMPS research discovery reward. A twist in the story is that Cooper's computer reported the prime on September 17th 2015 but it went unnoticed until
What is the point? I guess if you have to ask you aren't going to understand the answer. You can try to justify it in terms of pushing computing forward:
You can even point to the recent incident in which the GIMPS software pushed an Intel Skylake CPU, the latest thing, to fall over thereby uncovering a design flaw in the chip. In fact, the whole point is to find out about Mersenne primes and their mysterious nature. There is something strange about the way that you can take 2 and multiply it by itself a few times to get what has to be a very factorable number and then taking one away from the result changes the pattern so much that we have a prime with no factors. What might surprise you is that not only are there larger Mersenne primes to discover, but there could well be smaller ones - we haven't explored all the possibilites. However, size does matter and:
## More InformationGIMPS Project Discovers Largest Known Prime Number: 2 ## Related ArticlesPrime numbers and primality testing Search For Twin Prime Proof Slows Riecoin Crypto Currency Mines Primes For Riemann Hunt for Missing Prime Numbers In the Cloud Reaching The Unreachable - Pi Squared And Catalan's Constant
To be informed about new articles on I Programmer, sign up for our weekly newsletter, subscribe to the RSS feed and follow us on, Twitter, Facebook, Google+ or Linkedin.
## Comments
or email your comment to: comments@i-programmer.info |

Last Updated ( Saturday, 29 December 2018 ) |