![]() |
Gigantic Probable Prime Triplet found
Good news!
I found this week a Gigantic Probable Prime Triplet ! With huge efforts I found after 176 Gigantic Twins a set of 3 primes. Every prime have 10047 digits. These are [B]2072644824759 * 2^33333 [/B]-1, +1,+5. The problem, certify the 3rd number :-( best wishes Cybertronic |
Congratulations!
As for 2072644824759*2^33333+5, you can try to contact [URL="http://primes.utm.edu/bios/code.php?code=M"]F. Morain[/URL] and ask him to prove it for you. He did such things in the past. A 10,000 digit proof is doable, he already proved 12k, 15k, and 20k numbers. |
Thank you, but I have contact him ... he help me later. I had started PRIMO
v 3.06 but the number is to hard. No jump to TEST 2. The 2nd chance is PRIMO v 2.2.0 beta 4. , perhaps he found a way. |
[quote=Cybertronic;145762]Thank you, but I have contact him ... he help me later. I had started PRIMO
v 3.06 but the number is to hard. No jump to TEST 2. The 2nd chance is PRIMO v 2.2.0 beta 4. , perhaps he found a way.[/quote] PRIMO v. 2204 don't start a downrun sequenz :-(...so I hope I get help from F. Morain . |
where can u download the old version of primo
|
How many months would a certification take on a fast P4?
|
[quote=henryzz;145831]where can u download the old version of primo[/quote]
I have archived 6 versions , 2.0 , 2.204 , 2.205, 2.207, 301 and 3,06 . You can't download no previous version. best |
[quote=Andi47;145832]How many months would a certification take on a fast P4?[/quote]
I don't no. A P4 is slower than AMD Athlon / Phenom CPU. But it exist a good estimate for running time. Calculate ( (actual bits / total bits )^4.86) and you get the left running time in percent, independently from PC-System. You get 60 months on a P4 3.2 GHz for a 10k number. |
[QUOTE=Cybertronic;145844]I have archived 6 versions , 2.0 , 2.204 , 2.205, 2.207, 301 and 3,06 .
You can't download no previous version. best[/QUOTE] I used version 2.3.2 on a 16390 bit number - I wonder if it would exhibit any improvements over the versions you have listed. pm me if you want to try it. |
[QUOTE=Cybertronic;145844]You can't download no previous version.
best[/QUOTE] Damn, you're right. [QUOTE="Internet Archive"][B]Robots.txt Query Exclusion.[/B] We're sorry, access to http://www.ellipsa.net/public/misc/downloads.html has been blocked by the site owner via robots.txt. [/QUOTE] |
It possible I have also v 2.3.2, but 3.06 is faster or better for larger numbers.
It's no problem to get the other versions from me. Email me :-) I had veriyfed a 6223 digit number ( the actual triplet record ) in record time with version 3.0. Only 800h I need with 4 simultanious tasks. So it's possible to verify a 16390bit number in a week ! Also you can switched from v 2.3.2 to v.306 , it's easy ! |
| All times are UTC. The time now is 17:00. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.