Slashdot Mirror
42nd Mersenne Prime Confirmed
Jazzer_Techie writes "The possible Mersenne Prime discovered last week has now been confirmed. This prime has 7,816,230 digits, which makes it not only the largest Mersenne Prime, but also the largest prime of any kind ever discovered. For those who don't want to take time to read the article, the prime is 2^25,964,951 - 1."
Can anyone post those digits in case the site gets /.'ed?
Those math freaks sure are a bunch of GIMPS.
#11788398
That's an even number, so your post wasn't prime. Liar!
2^25,964,951-1th post!!
Ha, eat that first post guy!
A morning without coffee is like something without something else.
No Way!!
2^25,964,951 - 1.
Is my password! Oh Man, I guess everyone knows it now....
Now we can use the 41st and 42nd for a 50 megabit RSA key.
how many hours did it take to verify?
SCO are looking at legal action due to them copying, publishing AND comfirming their binary Linux code...
This is the 42nd one? I wonder if that means anything...
Behold, another webcomic!
GIMPS (Great Internet Mersenne Prime Search
They have Windows, Linux, FreeBSD, and OS/2 clients.
This one contains all the information to the meaning of life, the universe, and everything!
Berto
I'm not trying to be a troll here, but of what possible value is a really big prime number? Is there any practical value to it, or is it just an interesting bit of trivia?
That's a bit too large to fit on my poster! http://www.unihedron.com/projects/primes/index.php
Use this tool to determine if the ID number of your /. comment is prime!
It is confirmed that it is a prime, but it hasn't yet been confirmed that it is the 42nd largest prime, because some numbers have not been checked.
From TFA:
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.
I'll probably be modded down for this...
Didnt Penn State hold the prior record for largest prime? I'm not sure if it was mersenne or not.
The FAQ for this endeavor can be seen here.
One glaring ommission from the FAQ is "Why participate in this?" I guess if you have to ask why, there's no point in asking.
I'm a big tall mofo.
Maybe Paris Hilton could use this prime to encrypt her phone book next time?
To put this into real-world perspective, if you had 1 dollar for every digit in the number, you would have 7,816,230 dollars!
Wow...
"Leo Fender was in a 'state of grace' when he designed the Stratocaster." -- Paul Reed Smith
Mersenne primes are not suited for cryptography, so the discovery has little effect in the real world.
So does this make (2^25,964,951 - 1) * (2^25,964,950) the largest known perfect number?
I predict that the next one that will be found will be the 43rd. You heard it here first!
GIMPS is the name of the project that apparently was responsible for finding this, so the parent was a joke, not flame bait.
"Nobody likes a math geek, Scully."
sig not found
My brain said dupe, and the title disagreed...
Before you mod me funny, think, perhaps I was insightfully funny?
The top three previously known primes were Mersenne. Here's a list. At the time they were discovered, almost all largest Mersenne primes have held the record for biggest prime until being edged out by another Mersenne prime. I am not sure when a non-Mersenne last had that status, but it is a rare occurrence.
.."
Looking for Mersennes is "picking the low fruit" when it comes to prime hunting so I question the phrasing "Not only is it the biggest Mersenne
What would have been remarkable would have been if the new largest prime were *not* a Mersenne.
I think i will stick with 2^1 -1 :)
The war with islam is a war on the beast
The war on terror is a war for peace
It's the largest known.
I found it by leaving my browser open for a while on this page.
Here is a torrent of the prime number.. it's 25MB..
:)
M42.torrent
Some good times testing bandwidth
What are its factors?
But what is the purpose of knowing such large prime numbers? How can we use this in a practical way? I'm not flaming, because I'd really like to know how this can be used.
In any case, I like the idea of finding prime numbers just for the sake of finding them. Just like landing on the moon... because we can.
If you read the entry page (www.mersenne.org), you would have seen this link:
Why participate?
The AACS key is NOT 0xF606EEFD628B1CA427BEA93A9CA9773F
'algorithm' was wrong to use. I meant 'formula' in that numbers need to be tested to be prime, you cannot deduce by applying a known interation - hence why it takes such a long time to compute proof of a possible candidate.
We have a new answer to life, the universe and everything! It's 2^25,964,951 - 1
Now.. who wants to find out what this code refers to? I'm guessing we're looking at a safe or a bank account
I like muppets.
ok, so he can use 2^2 -1 :O)
boy, guys around here sure are quick to jump on a mistake. he was just being funny.
From TFA: This prime has 7,816,230 digits, which makes it not only the largest Mersenne Prime, but also the largest prime of any kind ever discovered If p1,p2.. pn are primes than p1*p2*..pn+1 is always a prime. I can always construct a prime using this to get a larger prime. I think he meant largest Mersenne prime discovered of any kind.
Am I the only one who was surprised to see a Darren Aronofski dedicated section on slashdot? Not that I'd disapprove... Darren's a supertalented director and I recommend PI to any slashdot geek.
Your pizza just the way you ought to have it.
that the digits make a phone number?? 225-964-9511 used to dial the residence of a man in Baton Rouge, Louisiana.
Now all you get is "the number you have dialed is not a working number"
Could this be the first telephone slashdotting in history!?
because by definition, primes are elements of your current ring that generate a proper ideal. The ideal generated by a unit element in the ring is obviously the entire ring, i,e. not proper; and in the ring of integers, 1 is most definitely a unit.
Please take a math class before posting on this subject.
... QWest announced to have solved their IT problems. Delayed phone connection times had appeared already in 1998, when the company was called US West.
How about a warning if you're going spoil the ending.
:-)
What can we use it for? What's the purpose of attempting to find larger prime numbers?
(2^((2^25,964,951) - 1) ) -1
I am the Alpha and the Omega-3
I'm setting a pot of coffee. I'm going to prove by hand that this thing is prime. Does any one have any Tylenol Arthritis pills I can borrow?
is the Mersenne Twister (MT), a pseudorandom number generator.
Pseudorandom number generators are periodic, that is they start repeating the sequence of "random" numbers, after a while. This is bad. The period of the MT is as big as the Mersenne Prime that you choose to base the algorithm on. So, if you wanted a REALLY long period, you could use this new prime. In practice, however, very few people need this long of a period.
Ok, now that we've finally found prime numbers so ridiculously large as to never have any practical purpose within any of our lifetimes, can we stop running the GIMPS screen saver, and move over all that computational power to something that might actually help mankind (within our lifetimes, even)?
e ensaver
No, not SETI@home (which is about as useful as GIMPS), can't folks please switch to something like the UD/NFCR "Screensaver Lifesaver" that processes some various highly computationally intensive biological problems (ligand fitting, etc.) related to a number of issues (these are directed at cancer research, specifically):
- http://www.chem.ox.ac.uk/curecancer.html
- http://www2.nfcr.org/site/PageServer?pagename=scr
- http://www.grid.org/download/gold/download.htm
I don't know, maybe it's just me, but when I hear of all the people running GIMPS, SETI@home, etc. etc., I feel a tiny bit sad that maybe all those unused cycles could be used towards something more useful, but not as sexy...
That's nice, dear. Do you want some tea?
Klerck, it's good to see you. You old scumbag you!
Beep. Boop. Beep. You have questions. I have answers and your home address.
...Geez I wish people would ask me these things first.
~
/me types "echo "2^25964951 - 1" | bc" and waits a long time...
Taco?
Take that Mersenne prime, keep adding 2 onto it until you reach a new prime (it shouldn't take too long), there you have it a non-Mersenne world beating prime.
thank God the internet isn't a human right.
...Metroid Prime. I would finally have had a new game for my Gamecube!
You must think in Russian.
No, because you're wrong...
The fact that n is prime doesn't mean that 2^n-1 is prime. The converse is true though - for 2^n-1 to be a prime, n needs to be a prime.
The AACS key is NOT 0xF606EEFD628B1CA427BEA93A9CA9773F
2^25,964,951 to 1 against also happens to be the finite amount of improbability needed to generate the infinite improbability drive out of thin air.
Still #1 -- Lonely Gay Geek
Wikileaks, no DNS
Recently overheard in rec.puzzles:
"15973846 is prime, base 28."
The Nobel Prize in mathematics was awarded yesterday to a California professor who has discovered a new number. The number is "bleen", which he says belongs between six and seven.
No, it's a Wobbl and Bob section, of course! Go watch an episode or two or three point one four; when come back bring Pi.
12216463006127794810775396403128843926736142422307 5246409537660469964558090568
61569077485126904041824640546847438710050537492630 0211252045279090179843593936
65081567696785664085904567474142 [...] 122164630061277948107753964031288439267
36142422307524640953766046996455809056861569077485 1269040418246405468474387100
50537492630021125204527909017984359393665081567696 785664085904567474142
If you care for all of them you can get them here.
Primes can't be even:
7 5246409537660469964558090568
61569077485126904041824640546847438710050537492630 0211252045279090179843593936
65081567696785664085904567474142 [...] 385490495601035978179020911166625548392
45482841605918218299877770398697774443727671302636 0619053009303039928104331685
207750711330535159626516698933257280577077247
1221646300612779481077539640312884392673614242230
How many are out there known so far? Where can I find an exact number? I'm curious.
I wonder if Darren got his idea for the movie PI based on the exploits of two mathematicians who built a supercomputer in their spare bedroom and computed PI to billions of digits. The story was in the New Yorker but it is now here.
"sweet dreams are made of this..."
so thats out of the question ;)
is there any event in the natural world that follows the patterns of prime numbers? I like to think pragmatically...
Now that we have conquered this incredible hurdle, lets utilize this prime as god intended - to cure cancer!
"Why participate in this?"
Because it's MY computer, I bought and paid for it, and I decide what to do with my extra cycles.
Well ... sorry for the dummy comment ... do we need to use a prime that big? Perhaps to scare some E.T. about our intelligence then.
Which is clearly false, as with any number that appears even in any even base. The parity is the same.
Socialism: a lie told by totalitarians and believed by fools.
This is a bit of inaccurate hand-waving, but the algorithm is closer to O(p^3). It takes p modular squares to do a Lucas-Lehmer test. A modular square in a bad implementation would take O(p^2) time, so it's O(p) * O(p^2) = O(p^3).
In reality, it's a bit less than O(p^3), because squaring modulo a Mersenne number can be done significantly faster than O(p^2), in fact approaching the theoretical speed limit O(p log2 p).
The reason the tests take so long is simply the size of the numbers. An optimal Lucas Lehmer test would take time O(p^2 log2 p). Since we use processors that do 32 bits at a time, p=25964951/32=811405. O(p^2 log2 p) > 12924002851764 operations. On a 3 GHz processor capable of 1 32x32 multiply per clock (unrealistic), that's 4308 seconds as an optimal minimum. Add realism and you can easily see how it takes a month.
calc.exe formula: 811405y2*(811405n/2n)
Melissa
"Screw Sun, cross-platform will never work. Let's move on and steal the Java language." - Visual J++ Product Manager
There is no proof yet that it is proven prime.
It is currently under verification.
I didn't get it either, at first.
Hint: 282933 is cool, base 28.
I got it and I still don't get it. :p
It seems to me that there is a fundamental confusion between cleverness and amusement in rec.puzzles. This must be the same crowd that giggles when the result of calculation is some profanity when the calulator is turned upside down.
Socialism: a lie told by totalitarians and believed by fools.
Cool.
Wikileaks, no DNS
Unfortunately, he's dead. Dead, dead, dead, dead, dead.