Slashdot Mirror
New Largest Prime Found: Over 7 Million Digits
Gilchrist continues "If you want to see the number in written in decimal, Perfectly Scientific, Dr. Crandall's company which developed the FFT algorithm used by GIMPS, makes a poster you can order containing the entire number. It is kind of pricey because accurately printing an over-sized poster in 1-point font is not easy! Makes a cool present for the serious math nut in your family.
For more information, the press release is available.
Congratulations to Josh and every GIMPS contributor for their part in this remarkable find. You can download the client for your chance at finding the next world record prime! A forum for newcomers is available to answer any questions you may have.
GIMPS is closing in on the $100,000 Electronic Frontier Foundation award for the first 10-million-digit prime. The new prime is 72% of the size needed, however an award-winning prime could be mere weeks or as much as few years away - that's the fun of math discoveries, said GIMPS founder George Woltman. The GIMPS participant who discovers the prime will receive $50,000. Charity will get $25,000. The rest will be used primarily to fund more prime discoveries. In May 2000, a previous participant won the foundation's $50,000 award for discovering the first million-digit prime."
But Pseudoprimes? Probability of primeness? Hah! You people cut corners!
/^[A-Z0-9._%+-]+@[A-Z0-9.-]+\.[A-Z]{2,4}$/i
... but why exactly is this so important? Can we use this number in any way, or is it just another prime?
Quid festinatio swallonis est aetherfuga inonusti?
Africus aut Europaeus?
The GIMPS Project found this prime. You too can contribute by downloading the client (for various OSes).
Thought I would drive the point home as this is a great DC project that doesn't receive half the attention of some of the more dubious DC projects...
----
I'm still searching for that even prime number bigger than 2...
I'm the Devil the Windows users warned you about.
That's where the money starts kicking in for these types of primes.
-I am an elective eunuch.
Does anyone know if a distributed computing project exists for finding large prime numbers? That would be a pretty cool way to spend some CPU cylces.
My algorithmics and discrete mathematics professors must be foaming at the lips in happiness-induced seizure-ific glory.
Yes, I know happiness does not induce seizure.
What a wonderful day in CS history. Well, here's to finding the 42nd! We can call it the Adams Prime. Wonder if it has some combination of 6's and 9's...hmm.
--- "To iterate is human, to recurse divine." -- Robert Heller
...if I add 2 to this number, I just might get another prime and find the new largest prime. :-)
Say all you will, but Optimus is still the ultimate prime.
I also reply below your current threshold.
Great. This should improve the distribution of elements in my hashtable implementation.
What is the marginal utility of finding out yet another prime number? Arent we doing just fine with the current ones? Or is this a radical discovery disproving something?
Prateek
is this number now copyrighted?
"It's so convenient to have a system where everyone is a criminal" - A. Hitler
He's also found the largest known perfect number, 2^(24,036,583-1)*((2^24,036,583)-1)
since 2^(odd number)+1 is always a multiple of 3
Who knows, one day you might find yourself struck in the tiger den with multiple doors all marked with Mersenne Primes, and a sign saying, "safe exit thru the door marked with the 41st Mersenne Prime". Yeah, then who is gonna bitch about not memorizing that sucker, huh?
Size does matter :)
Only on Slashdot is the first post modded Redundant.
Somebody set up us the prime.
I heard a rumor that some wiseguy in charge of printing changed one of the digits first - you may think you're paying for a prime, but they're really stiffing you and shipping a composite number!
http://www-gap.dcs.st-and.ac.uk/~history/HistTopic s/Prime_numbers.html
Creative Demolition
I'm not gonna believe that until I verified it myself.
so.. anyone got a clue on how long it will take on my good old Pentium Pro 200?
I guess these people trust the accuracy of these programs.
Personally I think someone should work this out on paper. Any volunteers/nominations?
01100010 01101001 01110100 01100101 00100000 01101101 01100101
"Hey baby, what's your prime?"
I understand that producing such a poster will be expensive but this is ridiculous:
Without frame: $77.00
With frame: $247.00
SCO's claim that their code has been stolen sounds more logical than this!
In binary: 11111111111111111111111111111111111111111111111111 11111111111111111111111111111111111111111111111111 11111111111111111111111111111111111111...
:/
Your comment violated the "postercomment" compression filter. Try less whitespace and/or less repetition. Comment aborted.
Sorry
I have discovered a truly marvelous demonstration of a 10 million digit prime which this margin is too narrow to contain.
Getting laid does wonders for the state-of-mind...
That's the theory anyway.
But once you enter slashdot.org in your address bar you are doomed.
i'll let everyone know when i am done!
-- ladies and gentlemen we are floating in space!
What kind of data structures are used to hold that many digits? Obviously, built-in native types can't handle numbers that big - so what do they use? Is it an array of "long long"? Are they stored in string format (each digit as a character)?
I have disovered a most elegant prime exceeding 10 million digits, alas the slashdot comment limit is too small to post it.
-
- - You can't take something off the Internet! That's like trying to take pee out of a swimming pool.
Good idea! I'll find the 42nd Mersenne Prime in no time with the processing power i got here.
ummm... let's see... *shakes the 8-ball* it says I should verify that 2^26.523.804-1 is the 42nd Mersenne Prime.
- These characters were randomly selected.
Actually the last 9 digits are 733969407, as this simple C program will show you:
// minus 1
#include <stdio.h>
int main()
{
int i;
int p = 1;
int m = 1000000000;
for (i = 0; i < 24036583; i++)
p = p*2 % m;
p = (p+m-1) % m;
printf("%d\n", p);
}
Yes.
What if the message that your SETI's going to find out happens to contains this prime!?!?
Isn't it possible that some civilisation is so advanced that their 'bc' would give back the 50th mersenne prime just like our bc would return 3*5
Wouldn't it be cool to find out that the msg you've just now found on SETI isn't gibberish but a hi from another advanced civilisation
God told me 2^19232891231089 - 1 is prime. Now where were those women for the worlds highest prime? Try to prove me wrong... see, you can't. Prime.
It is no longer uncommon to be uncommon.
EVERYONE will think of that.. "oh I'll just make my encryption key the largest known prime"... it's like setting 12345 on your luggage
7 million digits?
That primate must have big hands...
What's the frequency, Kenneth?
Recall that primality testing is now in polytime. It's currently impractical, since the polynomial is order 12 or thereabouts. But expect the search for the largest known prime to get much more boring once someone figures out how to get this algorithm down to a reasonable running time.
So, SETI at home never really appealed to me.
But this makes me want to go out and buy cheap computers and have a "server farm" at home to try to find primes.
I'm serious.
One day I'll be able to understand myself (yeah right, and the day after that I'll understand women).
The Internet is full. Go Away!!!
Among other things, Glucas is writen in C and Prime95 is mostly x86 assembly that's heavily optimized for SSE2 and the P4.
Not to mention that you can't expect the threading to scale perfectly. I'm surprised that there are any gains at all because the LL algorithm is so sequential. I remember hearing that Glucas could have done it in half the time on that machine if it had been optimized for NUMA, though.
Offtopic!?!?!
Am I seeing things
Who ever the hell moderated the parent needs some medication.
This AC was replying to one who didn't RTFA, and gets modded down by another who definitely RTFA.
(Karma be damned : I am no better than an AC now anyway)
Bullshit! It's divisible by three!
You're using her as bait, Master!
Been running prime 95 for 6 years now.
.. ive found no primes but the work ive done would have taken 307 years for a p90 computer to match... a p90 being the 'zero-point' computer when the project started.
Started with a p120 laptop, at times had a dozen computers teamed up.
In that time
George Bush + Linux = "I will not let information get in the way of the fight against Windows"
What's a good OS X client for this? They even have it compiled for OS/2 on the main DL page, but no apple support :)
Tibbon
tibbon.com
Hmmm... I know! Rocky V, plus rocky II, equals Rocky VII, Adrian's revenge!
Send lawyers, guns, and money!
Perfectly Scientific Homepage (they sell the poster): We have a physical poster of all (over) 7.2 million decimal digits available.
Poster Caption: The largest known (November 2003) explicit prime number 2^20996011-1, having more than 6.3 million decimal digits
We really don't know how many digits it has... But it's lots! (Seems to me it would be =20996011/(LN(10)/LN(2)), which is 6.320429 Million Digits, not 7 Million!)
I'd kinda like to see it...
And Intel didn't think 64bit computing was going anywhere ... ;)
---- "Logoff! That cookie shit makes me nervous!" - A. Soprano
any number of the form (2^n)+1 where n is odd is divisible by 3. Mersenne numbers require n to be odd.
no big sig
GIMPS is closing in on the $100,000 Electronic Frontier Foundation award for the first 10-million-digit prime.
When it is found that computer will be wondering: 1 $100.000 hookerbot or 100.000 $1 hookerbots?
"It's too bad that stupidity isn't painful." - Anton LaVey
Mind Booster Noori
it is the NEXT LARGEST prime after the last one.
you want a larger prime number than the new one? add to the current one a number consisting of a 1 with a billion zeros after it. that number is prime as well.
I am the Alpha and the Omega-3
2^(odd number)+1
= (-1)^(odd number)+1 [mod 3]
= -1 + 1 [mod 3]
= 0 [mod 3]
binary digits:
>>> math.floor(math.log(2**24036583-1,2))
24036583.0
I assume you realize that any number of the form 2^n -1 is going to take n bits to represent.
This story is perhaps the most pure example of "News for Nerds. Stuff that matters."
:- )
I love it!
$ dc -e '2 24036583 ^ 1 -p' > bigprime
Hey, man, look at that prime... THAT IS HUUGE.
I'm just saying it's a big prime is all.
Arbitrary sig
is it because they dont want to have to give up on their computers for weeks at a time?
Don't miss out on this incredible offer!
how large would a text file with 10 million characters be?
http://www.backstab.net
One thing I'd like to know is, what is the smallest unknown prime number? And more importantly, is there an award for finding it, thereby making it no longer unknown?
Thanks to the suggestion for...
:-)
3 6772297541 8473547677348600097\3 2085849334415641521263 5335213499669984946\4 2662105261107741637995 6346589355834130669\8 1099996307160208959114 6249605845552251245\8 7797735189577892265233 9915229521619514779\7 1220741611859625359434 4535443908358061475\5 6880887010955400164710 2077512671720670861\4 2856323336793806285343 7133547200496603279\ ... cut ...
1 65 5040635746326190400\0 1115064186802797305085 0098493495965965353\8 8885630947927139764390 6093267419703016252\3 0694859231047623622621 9731381759341727521\3 0906270990621862597287 8493025170887476672\7 8801564700107406013708 5901832324495455374\4 8448729599792041549432 0295787114054394490\7 4225623854962949493299 0957491791132574973\3 7485542595520771846437 8183256423142526858\0 67436921882733969407
;-)
dragon $ dc -e '2 24036583 ^1 -p' > bigprime
(took all of 10 minutes to generate on dual p4 2.4 RHEL box)
It is...
dragon $ cat bigprime | wc
104866 104866 7445464
dragon $ more bigprime
299410429404157172089048926340446938257
640221100741026265865109912
466002434564247027257716956
179364555490042058951262711
175040614646796742775814169
556831364845026895095824052
952581306252393965564387213
148470378380158230147594698
59604213874022357210583303129713006015584824733
455271472762839933371449084
075753824873167426913169171
097163289856117379398613206
317566776521589394602347629
740830923337133570472229256
389728390042504569248655378
404844569184665493106622303
679318356495493326241342950
687039800556031269118412915
Ends in 7. Yep. Looks prime to me.
Just kinda working the list from the website... the difference between the primes always *seem* to be EVEN (after the first couple). Hmm...
This is posted to the list like a new technical breakthrough that more than 1-2 people will be able to make use of this; like we should all go home and reset our prime number machine.
Why is so much technology pointed at this?
This reminds me of the long-running trickle of IRC bots, image viewers and 'light and fast browsers' that keep getting posted to Sourceforge and/or Freshmeat. We only need so many of these, ya know?
--- For a good time mail uce@ftc.gov
No, it's not. Not for finding Mersenne primes anyway. You see, the relative performance of different CPU types depends on the kind of work being done.
The benchmark charts at mersenne.org show that a P4 1800 MHz beats the Athlon 64 3400+ running at 2200 MHz. Even my own old P4 1600 MHz comes in ahead of the AthlonXP 3200+ running at 2200 MHz.
So, my guess is that there is some kind of work where the Itanium beats the P4 and the Athlon. Who knows, maybe this cluster was not bought to run MS Word or UT2004, or some other application where the Athlon beats the crap out of an Itanium or a P4?
I just received a notice from my administrator that I should change my password again... this'll teach him!
The best weapon of a dictatorship is secrecy, but the best weapon of a democracy should be the weapon of openness.
So many comments, yet not one link to the Prime Number Shitting Bear?
Not even the slightly more tame Prime Number Pooping Bear?
I hate sigs.
For goodness sake, if you're going to jot down a number, at least do it right...
Stu
So, just how long have you been waiting for an excuse (no matter how flimsy) to post that rant?
I ask because your tirade, although vigorous and interesting, is entirely unrelated to my post.
Since you seem to be articulate and well read I'm giving you the benefit of the doubt and assuming that you have some sort of agenda...
What is it exactly?
100 is a three digit number, it isn't 50% of 100,000 (a six digit number).
The new prime has 7.2 million digits. That is 10e-2799998 % of "the size needed", 10e10000000.
Yep, Itanium MHz beat everything else (including x86, AMD, Sparc, MIPS and PPC) on the molecular mechanics code we're running.
It's a close second to PPC on the QM code.
(As an aside, for this code: PIV/Xeon MHz aren't worth the ink they're printed with on the die)
Count your blessings,
:p
:P
I've seen the goatse version of this.... (>_<);;;
Thankfully, I've forgotten the URL.
I'm sure some poster here will remedy that oversight....
2 to the 24,036,583th power?
2 to the 24,036,583rd power!
Don't thank God, thank a doctor!
main() { ;
;
;
int last_digit
if( is_even(last_digit) ) {
poster_is_wrong()
}
return 0
}
/* please don't mock my style */
What is the purpose behind the research for insanely large prime numbers? I can almost understand the fascination, but my primitive mind can accept no logical reasoning behind the pursuit. Any guidance is appreciated!
I discovered a verry huge composite number in a matter of seconds.
2^999999999999
... isn't moderation supposed to equal 100%?
___
It's the end of my comment as I know it and I feel fine.
The aliens are inside the number! Didn't think of looking there , did you?!!! Yeesh!
the preceding comment is my own and in no way reflects the opinion of the Joint Chiefs of Staff
You could just go out and buy a new Athlon 64 3800 and have completed 307 years for a p90 this afternoon!
Stuff like this makes me wonder if mathematics is going through one of those "data collection" phases that all sciences go through. Where everyone is doing all the "stamp collecting" that following generations will use in building new theories.
the preceding comment is my own and in no way reflects the opinion of the Joint Chiefs of Staff
Not all prime n work, but no non-prime n can work.
You are technically correct, but you missed the point. The original question regarded an infinite number of prime twins of the form 2^n-1, 2^n+1. Since 2^n+1 for any odd n is divisible by 3, there can be only one pair of primes of that form. that pair shows up when n = 2, thus providing the prime pair 3,5.
no big sig
The only statement you've made on this thread about numbers of the form 2^n-1 was obviously false. Your conclusion here ignores all the 2^n+1 for even n even though some are prime (Fermat primes, e.g. 17, 257, 65537). In order for your "proof" to apply it must be demonstrated that the only even n for which 2^n-1 is prime is n=2. This requires the statement I made. Who's missing the point?
Besides, if I really wanted to miss the point I'd point out that you're wrong again with another counterexample:
The number -1 is odd, and 2^(-1) + 1 = 3/2