![]() |
1399*2^1762191-1 (530476 digits)
|
1347*2^1765384-1 (531437 digits)
1005*2^1765454-1 (531458 digits) |
4069*2^1781691-1 (536347 digits)
|
An another million digits prime for k=113:
113*2^3628034-1 (1092150 digits) :smile: |
1005*2^1775235-1 (534402 digits)
|
k=37
37·2[SUP]6660841[/SUP]-1 ([URL="http://primes.utm.edu/primes/page.php?id=118270"]2,005,115 digits[/URL])
(Note: This was in context of the Riesel-like-base1024 conjecture, so only n ≡ 1 (mod 10) were tested up to n=6700000.) |
Congrats on your bi-mega :toot:
It is amazing that such a prime was verified in 3.61 hours by CC @ UTM. |
Congratulations! :groupwave:
|
Serge's find is valued at 8% of RPS' entire production currently on top 5000.
Congratulations! |
Ah, heck. It was only luck.
But: "The more I practice, the luckier I get". (Which might be one of those things that [I]Yogi Berra also never said[/I]. The authorship is disputed, as is the case with any [I]bon mot[/I] including "Prediction is very difficult, especially about the future") |
[QUOTE=Batalov;379365]37·2[SUP]6660841[/SUP]-1 ([URL="http://primes.utm.edu/primes/page.php?id=118270"]2,005,115 digits[/URL])
(Note: This was in context of the Riesel-like-base1024 conjecture, so only n ≡ 1 (mod 10) were tested up to n=6700000.)[/QUOTE] Great prime discovery Batalov :smile: Here's another smallish one: 1333*2^1784103-1 (537072 digits) |
| All times are UTC. The time now is 22:58. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.