Slashdot Mirror
42nd Mersenne Prime Probably Discovered
RTKfan writes "Chalk up another achievement for distributed computing! MathWorld is reporting that the 42nd, and now-largest, Mersenne Prime has probably been discovered. The number in question is currently being double-checked by George Woltman, organizer of GIMPS (the Great Internet Mersenne Prime Search). If this pans out, GIMPS will have been responsible for the eight current largest Mersenne Primes ever discovered."
... the moment they discovered the 42nd prime, the world was immediately destroyed to make way for an intergalactic superhighway.
Chics dig it.
Someone you trust is one of us.
A Mersenne number is all ones when written in binary. If its prime, it is a Mersenne prime.
The theory is that there is an infinite number of these numbers, but they are unlikely to prove the theory by finding them all...
Call me when a distributed computing project finds Fruit Fucker Prime.
3D Printing Tips and Tricks at Zheng3.com
Either that or their eyes glaze over and you sneak a quick peck before they slap you silly.
"ah, l'amour"
A feeling of having made the same mistake before: Deja Foobar
I'm not sure what else they're actually good for, but searching for these with Prime95 is a great way of putting the flame to your CPU.
Prime95 (which searches for these primes) really puts a load on the CPU and raises the temperature in a hurry. It's commonly used to test the stability of overclocking configurations since it stresses the chip and is able to detect if there is an error in the computation.
Generally, if you can run Prime95 for 24 hours straight, most people will consider the overclocked PC a stable configuration.
>What is number going to for us? Is it going to feed us? No. It would be better if the computer power was used for cancer research or finding aliens.
Because of course aliens will feed us...
They even will bring a cookbook with them, "To Serve Mankind."
You can't talk about Wikipedia's flaws on Wikipedia
If this pans out, GIMPS will have been responsible for the eight current largest Mersenne Primes ever discovered.
In your face, Photoshop!
This has not yet been confirmed, therefore there could be less than 42 known Mersenne primes.
Hovewer, according to MathWorld, there is a chance that it is not the 42nd Mersenne prime at all for another reason
"However, note that the region between the 39th and 40th known Mersenne primes has not been completely searched, so it is not known if M20,996,011 is actually the 40th Mersenne prime.."
Looks like the big math guys don't exactly know how to count at all
Back in the dark ages when I was in university, I took a class called "Mathematics and Poetry". I thought it would be a useful bird course in my senior year, but it turned out to be both interesting and challenging.
As part of the course, we studied Mersenne primes. At the time, I was dabbling in x86 assembler, and I decided to write a program to calculate the then largest known Mersenne prime number: 2^31 - 1, which worked out to 65,050 digits.
The size worked out perfectly, as in 1989 that meant it could fit into one 65KB segment on my blazing-fast 8Mhz 8088. As I recall, the runtime was about two days. The program still works--I can't remember how long it took to run on a 3Ghz P4, but I think it was just a few minutes.
I'm sure any competent programmer (read--not me) could calculate the result much faster, but at the time I was very proud of my little creation.
It's a mathematical curiosity in some cases - just to find it for the sake of finding it, or for the glory of finding it. You know, like being the first to do something cool.
Also, necessity is the mother of invention. Even if Big Primes aren't really a necessity, it has brought forth some really innovative algorithms and methods to finding prime numbers. Furthermore, it has developed newer and faster ways for multiplying integers.
In 1968, Strassen figured out how to multiply integers quickly by using Fast Fourier Transforms. Strassen, along with Schönhage improved on the method and published a refined version in 1971. GIMPS now uses an improved version of their algorithm. This improved version was developed by Richard Crandall (a longtime researcher of Mersenne Primes).
Another application of finding Prime Numbers is to test computer hardware. Since testing Primes involves a thorough excercise of basic mathematical operations, it provides a good test for hardware. Software routines from GIMPS were used by Intel to test the PII and the Pentium Pro chips before they were shipped. The search for prime numbers was also indirectly responsible for the discovery of the infamous FDIV bug on the Pentium, during the calculation of the twin prime constant (by Thomas Nicely).
Vivin Suresh Paliath
http://vivin.net
I like
You can say even more. If M can be written as 2^n - 1, then M is said to be a Mersenne number. If M is also prime, then it is a Mersenne prime. For 2^n - 1 to be a Mersenne prime, n must be a prime number, since we have
... + 2^(a))
2^(ab) - 1 = (2^a-1)(2^(a(b-1)) + 2^(a(b-2)) +
For instance, 2^6-1 is (in binary) 111111 = 1001 * 111, as predicted by the above factorisation.
If p is a prime number and if 2^p-1 is a Mersenn prime, then, as was pointed out above, 2^(p-1)(2^p-1), is a perfect number. Moreover, if N is an even perfect number, then N can be written (uniquely) as 2^(p-1)(2^p-1) where p is a prime number and 2^p-1 is a Mersenne prime.
Wikipedia has a reasonably intelligible introduction to perfect numbers, and MathWorld contains a proof of why every even perfect number must have the form claimed above.
To see why M = 2^(p-1)(2^p-1) is a perfect number when p, 2^p-1 are primes, it suffices to note that s(n), the function that maps an integer to the sum of its divisors (e.g. s(6) = 1 + 2 + 3+6, s(8) = 1 + 2 + 4+8) is multiplicative in the number-theoretic sense, that is to say s(ab) = s(a)s(b) whenever a, b have no prime factors in common. Then evaluating s(M) is simply a case of evaluating it on the factors, which are relatively prime since one is a power of 2, 2^(p-1), and the other is an odd prime, 2^p-1. s(2^p-1) = 2^p-1 + 1 = 2^p (since we have a prime number), and 2^(p-1) = 2^p -1 is an easy formula that is true of all powers of 2. Hence s(M) = 2^p(2^p-1) = 2 ( 2^(p-1) (2^p-1) = 2s(M). That is to say, the sum of all the divisors of M add up to twice M, and if we leave the divisor M itself out of the sum, we see that M is a perfect number.