|
2015-01-03, 01:28
|
#155 |
May 2005
110010110002 Posts |
I don't blame you, after all AFAIR you're using nV hardware
|
|
|
|
2020-05-29, 23:01
|
#156 |
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
24·11·53 Posts |
Dusted off the GMQfact code; recompiled for 1060/2060 cards (sm_61, sm_75) and sieved to 61+ bits the next range 5.1-10M -- which is now reserved for Batalov+Propper
|
|
|
|
|
2020-06-19, 20:14
|
#157 |
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
24×11×53 Posts |
Nearly done and continuing with 10-12M. ... and to 15M ... and on to 21M...
|
|
|
|
|
2020-07-31, 22:13
|
#158 |
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
221608 Posts |
the new largest known G-M norm
After a rather depressing gap a curiously strong mint was found:
215317227 + 27658614 + 1 is the new largest known prime Gaussian-Mersenne norm (also, it is a Proth prime and a Generalized Unique prime). |
|
|
|
|
2020-07-31, 22:23
|
#159 | |
Sep 2002
Database er0rr
1110000010012 Posts |
Quote:
|
|
|
|
 |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| New PC dedicated to Mersenne Prime Search | Taiy | Hardware | 12 | 2018-01-02 15:54 |
| Gaussian integers- use of norms | devarajkandadai | Number Theory Discussion Group | 11 | 2017-10-28 20:58 |
| Low clock speeds on Mersenne Prime search | Ammonia | Hardware | 2 | 2016-01-21 17:46 |
| Testing Mersenne cofactors for primality? | CRGreathouse | Computer Science & Computational Number Theory | 18 | 2013-06-08 19:12 |
| Can I specify the range to search the Mersenne Prime? | Unregistered | Information & Answers | 22 | 2012-03-20 11:38 |
