View Single Post
Old 2013-09-23, 12:11   #927
3.14159
 
3.14159's Avatar
 
May 2010
Prime hunting commission.

24·3·5·7 Posts
Default

moar:
93283*295606+1 (28786 digits)
Primality testing 93283*2^95606+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 3
Special modular reduction using all-complex AMD K10 type-1 FFT length 8K, Pass1=32, Pass2=256 on 93283*2^95606+1
Calling Brillhart-Lehmer-Selfridge with factored part 99.98%
93283*2^95606+1 is prime! (49.2659s+0.0040s)

edit: range for k * 2^23380 + 1
Code:
Primality testing 75555*2^23380+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 11
Special modular reduction using all-complex FFT length 2K on 75555*2^23380+1
Calling Brillhart-Lehmer-Selfridge with factored part 99.93%
75555*2^23380+1 is prime! (0.8516s+0.0037s)
Primality testing 78073*2^23380+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 3
Special modular reduction using all-complex FFT length 2K on 78073*2^23380+1
Calling Brillhart-Lehmer-Selfridge with factored part 99.93%
78073*2^23380+1 is prime! (0.8585s+0.0032s)
Primality testing 94893*2^23380+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 7
Special modular reduction using all-complex FFT length 2K on 94893*2^23380+1
Calling Brillhart-Lehmer-Selfridge with factored part 99.93%
94893*2^23380+1 is prime! (0.8495s+0.0037s)
Primality testing 112525*2^23380+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 3
Special modular reduction using all-complex FFT length 2K on 112525*2^23380+1
Calling Brillhart-Lehmer-Selfridge with factored part 99.93%
112525*2^23380+1 is prime! (0.8538s+0.0034s)
Primality testing 122065*2^23380+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 3
Special modular reduction using all-complex FFT length 2K on 122065*2^23380+1
Calling Brillhart-Lehmer-Selfridge with factored part 99.93%
122065*2^23380+1 is prime! (0.8529s+0.0037s)
Primality testing 122851*2^23380+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 3
Special modular reduction using all-complex FFT length 2K on 122851*2^23380+1
Calling Brillhart-Lehmer-Selfridge with factored part 99.93%
122851*2^23380+1 is prime! (0.8502s+0.0034s)
Primality testing 128305*2^23380+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 3
Special modular reduction using all-complex FFT length 2K on 128305*2^23380+1
Calling Brillhart-Lehmer-Selfridge with factored part 99.93%
128305*2^23380+1 is prime! (0.8536s+0.0034s)
Primality testing 141817*2^23380+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 3
Special modular reduction using all-complex FFT length 2K on 141817*2^23380+1
Calling Brillhart-Lehmer-Selfridge with factored part 99.93%
141817*2^23380+1 is prime! (0.8488s+0.0035s)

Last fiddled with by 3.14159 on 2013-09-23 at 12:46
3.14159 is offline   Reply With Quote