mersenneforum.org (https://www.mersenneforum.org/index.php)
-   Riesel Prime Search (https://www.mersenneforum.org/forumdisplay.php?f=59)
-   -   POST LOTS AND LOTS OF PRIMES HERE (https://www.mersenneforum.org/showthread.php?t=13180)

 pb386 2010-04-04 16:56

1239*2^815957-1 (245631 digits)

 amphoria 2010-04-05 12:42

4067*2^568776-1 (171223 digits)
4063*2^569491-1 (171438 digits)

 pb386 2010-04-05 19:13

1253*2^817490-1 (246093 digits)
1137*2^817593-1 (246124 digits)
1085*2^817644-1 (246139 digits)

 amphoria 2010-04-06 18:08

2185*2^764875-1 (230254 digits)
1405*2^765505-1 (230444 digits)

 amphoria 2010-04-07 05:18

2093*2^765710-1 (230505 digits)

 amphoria 2010-04-07 22:29

9th Drive:

29445*2^627251-1

 amphoria 2010-04-09 04:22

9th Drive:

14895*2^627529-1 (188910 digits)

 amphoria 2010-04-09 16:25

4039*2^571923-1 (172170 digits)

 Cruelty 2010-04-09 16:57

59*2^3408416-1 (1026038 digits) so far it's the smallest known megaprime :whistle:
Verification using PFGW:[code]Primality testing 59*2^3408416-1 [N-1/N+1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 3
Running N+1 test using discriminant 7, base 6+sqrt(7)
Running N+1 test using discriminant 7, base 10+sqrt(7)
Special modular reduction using FFT length 224K on 59*2^3408416-1
Calling N+1 BLS with factored part 100.00% and helper 0.00% (300.00% proof)
59*2^3408416-1 is prime! (110852.6366s+0.0192s)[/code]

 VBCurtis 2010-04-09 17:41

[QUOTE=Cruelty;211179]59*2^3408416-1 (1026038 digits) so far it's the smallest known megaprime :whistle:
Verification using PFGW:[code]Primality testing 59*2^3408416-1 [N-1/N+1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 3
Running N+1 test using discriminant 7, base 6+sqrt(7)
Running N+1 test using discriminant 7, base 10+sqrt(7)
Special modular reduction using FFT length 224K on 59*2^3408416-1
Calling N+1 BLS with factored part 100.00% and helper 0.00% (300.00% proof)
59*2^3408416-1 is prime! (110852.6366s+0.0192s)[/code][/QUOTE]

Wowwwwwwwww. :bow:
Nice find, sir.
-Curtis

 Beyond 2010-04-09 21:26

[QUOTE=Cruelty;211179]59*2^3408416-1 (1026038 digits) so far it's the smallest known megaprime :whistle:
Verification using PFGW:[code]Primality testing 59*2^3408416-1 [N-1/N+1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 3
Running N+1 test using discriminant 7, base 6+sqrt(7)
Running N+1 test using discriminant 7, base 10+sqrt(7)
Special modular reduction using FFT length 224K on 59*2^3408416-1
Calling N+1 BLS with factored part 100.00% and helper 0.00% (300.00% proof)
59*2^3408416-1 is prime! (110852.6366s+0.0192s)[/code][/QUOTE]

Congrats! :tu:

All times are UTC. The time now is 05:33.