![]() |
2650-2655 complete, no primes
|
2620-2650 completed, taking 2695-2740.
|
I would soon like to reserve another range of 40k or more.
(At the moment only 2740-2750 available) |
More files added, up to 2850k.
|
1 Attachment(s)
2655-2695 finished, no primes (file attached).
Taking 2740-2820. |
[URL="http://primes.utm.edu/primes/page.php?id=95467"]17*2^2721830-1[/URL] (819354 digits) is prime!
:party: |
[QUOTE=unconnected;233641][URL="http://primes.utm.edu/primes/page.php?id=95467"]17*2^2721830-1[/URL] (819354 digits) is prime!
:party:[/QUOTE] Congratulations!!! |
[QUOTE=unconnected;233641][URL="http://primes.utm.edu/primes/page.php?id=95467"]17*2^2721830-1[/URL] (819354 digits) is prime!
:party:[/QUOTE] Congratulations, indeed! It's definitely about time for a prime on this k...600K-2.7M is enormous as far as primeless gaps go. |
unconnected, great !!
Congratulations! |
I'm releasing 2740-2820.
Congratulations @ unconnected we finally found the prime. |
[QUOTE=unconnected;233641][URL="http://primes.utm.edu/primes/page.php?id=95467"]17*2^2721830-1[/URL] (819354 digits) is prime!
:party:[/QUOTE] Could someone explain why Prime95 was in the prover code? I thought it was only used for testing mersenne numbers (LL), not for k*2^n-1 numbers (LLR). |
| All times are UTC. The time now is 21:22. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.