nice.
Congrats PaleSeptember !!
http://www.mersenneforum.org/showthread.php?t=11296Originally Posted by philmoore
nice.
Congrats PaleSeptember !!
<Does the (probable) Prime Happy Dance>
I've been bouncing off the walls with excitement these last two days whilst Phil ran some of the confirmation tests. In the linky'd thread, he calculates it'd take ~500 million years to verify it as an actual prime. I think I'll be happy with a probable in the meantime!
Onwards to another one! Woo!
Wow, congrats paleseptember, that's great news!
I'm surprised it would take so long to do a full primality test. It only took a single core of my C2D 20 minutes to confirm a ~45,000 digit prime using PFGW. I guess the time taken to perform these tests must increase exponentially with the length of the number.
nice one paleseptember, now can someone show me the full number
Semi-retired from Free-DC...
I have some time to help.....
I need a new laptop,but who needs a laptop when you have a phone...
Now to remember my old computer specs..
Congrats, that is great news. Also very good timing as I will use that information in my talk on prime numbers in a couple of weeks. It will be especially good to use that as a concrete example of how deterministic primality testing in the general case takes a LONG time (ie: 500 million years) compared to specialized cases like Mersenne Primes which can be 28x larger (ie: 12.9 million digits) and only take a week or two to verify.
Jeff.
paleseptember - exactly defiantly pulling the faces, or just mastering the one "look"... or just going probability ratio 1: 2^n-1 and falling... aka from Hitchhikers....
Semi-retired from Free-DC...
I have some time to help.....
I need a new laptop,but who needs a laptop when you have a phone...
Now to remember my old computer specs..
Assuming the 500 million years refers to testing on one core of a modern computer, and assuming Moore's Law isn't broken, they should be able to actually test for primality sometime around the year 2065 or so.
Be sure to contact me on the psychic Internet link to Mars, so I can tell my female clone(shouldn't take many changes to make a female version of me) the good news.
And, yes, I'm both bored and very loony. lol
I don't really wish (oh yes I do!) to cheer my own achievements (well, my computer's acheivements), but!
http://www.mersenneforum.org/showthread.php?t=11425
In summary, with a stupid amount of luck, we've eliminated the second of five sequences for the Dual Sierpinski Conjecture Huge huge thanks to the sievers, and especially engracio who has been flying through the sieving!
Originally Posted by Phil Moore
<cue the happy dance>
Edit: Digital Parasite: Another data point for your presentation about deterministic primality testing? <grins>
Doh too late, the presentation was this past Friday. Wow that was quite a jump, congrats again.
I think the talk went very well, people asked lots of questions and seemed interested. They were very suprised about the 400k digit one you found that would take 500 million years to verify, this would have floored them even more.
Death: I'm probably not the person to be answering those questions, but I'll give it a shot. There are shortcuts for sierpinski and riesel numbers (those forms that you suggested). Unfortunately, there doesn't seem to be such shortcuts for other forms.
There are some more details at the coordinating forum: http://www.mersenneforum.org/forumdisplay.php?f=86
Phil Moore wrote a good introduction to the project. The Integers paper (linked in the SoB forum here at Free-DC, the main SoB site, and the mersenneforum linked above) had some more technical details if you're interested.
That is right, there are specialized primality tests for some numbers of special form like Mersenne numbers. That is why Mersenne numbers and Proth primes dominate the top largest known primes list: http://primes.utm.edu/largest.html
The Lucas-Lehmer test (used for Mersenne numbers) is the fastest deterministic test on the planet and so not surprisingly it was the method used to find the top 8 primes listed. If you don't have a number of a special form, then the fastest test you have is ECPP (Elliptic Curve Primality Proof). The largest number ever proven using ECPP is 20562 digits long (http://primes.utm.edu/top20/page.php?id=27) and that was a significant effort using many machines. So you can see the limitation of what is practical with current systems.
Just 60 years ago, the largest known prime number was only 44 digits long so we have come a long way since the start of the computing era.
paleseptember, I hear it is mighty hot down under these days. Hopefully all your computers aren't starting to melt...
DP: It's horrendous down in Melbourne and Adelaide. They just set a record for consecutive days above 40C (104F). It topped 45C yesterday (113F). It's not quite so bad up here in Wollongong, as I'm five minutes from the ocean on the east, and an escarpment on the west. The heat is pretty much pushed over the top of the city and settled on the water when we have strong Westerlys. It's still mid- to high-30s during the day though.
However, we're all waiting for the horror situation to develop:
Everything is so very very dry. There are already fires starting on the outskirts of Melbourne. Five houses were lost yesterday. One tossed cigarette or bottle, this intense dry heat, and a strong wind, and we're looking at serious bushfires. Again.Originally Posted by AAP Reuters
Gotta love Orrrstraya
However, my flat in on the ground floor of a nice old brick building, facing south-ish, so it stays a fair bit cooler. And my office computer, well, yeah. I'll have to get a close eye on it. I've moved into the library a few times this last week already!
Yikes. I have never been to Wollongong, the furthest south I have been in Sydney and I spent a few weeks in the Brisbane and Frasier Island area in 2000. If it get too hot for you, come and visit here, we are having a heat wave here too, supposed to get up to 0C tomorrow (right now -31C with the wind chill).
Sheesh, he did it a again! This time he found the first million+ digit probable prime:
http://www.mersenneforum.org/showthread.php?t=12376
That is a spicy meat-a-ball!To prove that this number is actually prime would take around 125 billion years if we could gear up ECPP on a single processor.
It's a statistical anomaly, I swear! There is a dedicated group on the project: Geoff, Kent, Engracio, Jeff, Serge, Geoff, Phil, and Dmitry, all of whom are slowly chipping away at the moment. I just got lucky. Three times. Ummmm....
And George Woltman for Prime95 and Geoff Reynolds for sr2sieve! Their code is l33t!
I think all 5 would entitle PS to the Freedom of Free_DC and special status.. But I think the group should devote themselves to actually proving the primes . That should keep them occupied until hell freezes over and so out of any mischief
Like an ol` 8086, slow but serviceable.
One advantage of old age...nobody can tell you how much cake you can eat