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.
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.
...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.
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 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
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.
i'll let everyone know when i am done!
-- ladies and gentlemen we are floating in space!
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.
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);
}
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
7 million digits?
That primate must have big hands...
What's the frequency, Kenneth?
BTW wasn't the polynomial order 6 whenever a unproved-but-likely hypothesis was true?
2^19232891231089 - 1 isn't prime.
3765761637264764023 divides it.
IAAM.
YAW
Your head of state is a corrupt weasel, I hope you're happy.
Primality tests for numbers of the form k*b^n+/-1 have always (since Proth's time) been poly time, in fact O(n^(2+eps)).
http://primepages.org/
'proving'
YAW.
Your head of state is a corrupt weasel, I hope you're happy.
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.
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"
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
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
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?
2^24036583-1 + 10^1000000000 is divisible by 13, therefore it is not prime.
What kind of math background do you have?
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.
Since the main routines of Prime95 are in intel assembly it can't be compiled for the Mac. For the mac you can use GLucas (which was also used in the 2 verification runs), you kan find it at http://glucas.sourceforge.net/
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?