mersenneforum.org

mersenneforum.org (https://www.mersenneforum.org/index.php)
-   Proth Prime Search (https://www.mersenneforum.org/forumdisplay.php?f=109)
-   -   Search for prime Gaussian-Mersenne norms (and G-M-cofactors) (https://www.mersenneforum.org/showthread.php?t=19235)

Cruelty 2008-12-30 20:24

1.37-1.38M complete, reserving 1.38-1.39M

Cruelty 2009-02-21 17:49

complete till 1.4M, reserving 1.4M-1.45M

Cruelty 2009-07-17 20:36

complete till 1.45M, reserving 1.45M-1.5M

Cruelty 2009-10-19 13:16

reserving 1.5M-1.51M

Cruelty 2009-12-18 22:47

complete till n=1.51M, reserving 1.51M - 1.55M

Cruelty 2010-02-13 09:15

Reserving 1.55 - 1.56M

Cruelty 2010-04-06 17:28

complete till n=1.56M, reserving 1.56M - 1.6M

Cruelty 2010-08-05 20:29

complete till n=1.6M, reserving 1.6M - 1.66M

Cruelty 2010-12-30 23:56

complete till n=1.66M, reserving 1.66M - 1.7M

Cruelty 2011-01-20 13:15

Well, here comes 6-th largest PRP @ 502485 digits ;-)

(2^1669219-2^834610+1)/5 is 5-PRP, originally found using LLR ver.3.8.4 for Windows (no factor till 2^54).
This is a Fermat PRP at base 3, 5, 7, 11, 13, 31, 101, 137 - confirmed with PFGW ver.3.4.4 for Windows (32-bit).

Additionally using the following command with PFGW:
pfgw -l -tc -q(2^1669219-2^834610+1)/5

I've received the following result:
[code]Primality testing (2^1669219-2^834610+1)/5 [N-1/N+1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 2
Running N-1 test using base 5
Running N-1 test using base 7
Running N-1 test using base 11
Running N-1 test using base 19
Running N-1 test using base 29
Running N+1 test using discriminant 37, base 2+sqrt(37)
Calling N-1 BLS with factored part 0.02% and helper 0.00% (0.07% proof)
(2^1669219-2^834610+1)/5 is Fermat and Lucas PRP! (229144.7431s+0.0642s)[/code]

Cruelty 2011-07-17 16:33

complete till n=1.7M, reserving 1.7M - 1.77M


All times are UTC. The time now is 12:02.

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.