![]() |
S643 is proven with [URL="http://primes.utm.edu/primes/page.php?id=115202"]6·643^164915+1[/URL] (463117 digits)
|
[QUOTE]S643 is proven with [URL="http://primes.utm.edu/primes/page.php?id=115202"]6·643^164915+1[/URL] (463117 digits) [/QUOTE]Nice again Serge. Told ya they come in pairs.:bow:
I still think we have another S6 in the works. |
[URL="http://primes.utm.edu/primes/page.php?id=115249"]48*580^174782 - 1
[/URL] |
I also have a [URL="http://primes.utm.edu/primes/page.php?id=115256"]small one[/URL]. Here today, gone tomorrow.
|
R318
That makes R318 a 1ker. Nice
Serge is a prime finding machine lately.:banana: |
78*916^120247-1
78*916^122431-1 R916 is proven :cool: |
[QUOTE=unconnected;354976]78*916^120247-1
78*916^122431-1 R916 is proven :cool:[/QUOTE] Very proven one might say :showoff: |
[QUOTE=unconnected;354976]78*916^120247-1
78*916^122431-1 R916 is proven :cool:[/QUOTE] Wow. I think that's the first time that finding 2 primes close together for the same k to prove a base has happened at CRUS. A few years ago, Max and I separately found primes for the same k on S16 in different reserved ranges but it didn't prove the base. I think it also might have happened on our PRPnet server at one time or another but once again, never for a proof. Congrats! |
After a long dry spell: 52*701^163776+1 is prime. At 466063 digits, this will make it in at #5 on the largest CRUS Sierpsinki primes to prove a conjecture.
|
Nice Mark. It has been a while.:party:
|
A well-deserved break, Mark! Congrats!
|
| All times are UTC. The time now is 22:40. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.