View Single Post
Old 2013-09-23, 03:10   #926
3.14159
 
3.14159's Avatar
 
May 2010
Prime hunting commission.

110100100002 Posts
Default

More primes:

80256*630766+1 (23946 digits)
Primality testing 80256*6^30766+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 5
Special modular reduction using all-complex AMD K10 type-1 FFT length 8K, Pass1=32, Pass2=256 on 80256*6^30766+1
Running N-1 test using base 23
Special modular reduction using all-complex AMD K10 type-1 FFT length 8K, Pass1=32, Pass2=256 on 80256*6^30766+1
Running N-1 test using base 29
Special modular reduction using all-complex AMD K10 type-1 FFT length 8K, Pass1=32, Pass2=256 on 80256*6^30766+1
Calling Brillhart-Lehmer-Selfridge with factored part 61.30%
80256*6^30766+1 is prime! (52.2363s+0.0048s)

28301*228657+1 (8632 digits)
Primality testing 28301*2^28657+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 3
Special modular reduction using all-complex FFT length 2K on 28301*2^28657+1
Calling Brillhart-Lehmer-Selfridge with factored part 99.95%
28301*2^28657+1 is prime! (1.3308s+0.0056s)

Part of a range for k * 3^14500 + 1:

Code:
Primality testing 30146*3^14500+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 2
Special modular reduction using all-complex FFT length 2K on 30146*3^14500+1
Calling Brillhart-Lehmer-Selfridge with factored part 99.93%
30146*3^14500+1 is prime! (1.0725s+0.0044s)

Primality testing 30922*3^14500+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 2
Special modular reduction using all-complex FFT length 2K on 30922*3^14500+1
Calling Brillhart-Lehmer-Selfridge with factored part 99.93%
30922*3^14500+1 is prime! (1.0759s+0.0055s)

Primality testing 33768*3^14500+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 11
Special modular reduction using all-complex FFT length 1536 on 33768*3^14500+1
Calling Brillhart-Lehmer-Selfridge with factored part 99.95%
33768*3^14500+1 is prime! (0.8555s+0.0045s)

Primality testing 41736*3^14500+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 5
Special modular reduction using all-complex FFT length 2K on 41736*3^14500+1
Running N-1 test using base 13
Special modular reduction using all-complex FFT length 2K on 41736*3^14500+1
Calling Brillhart-Lehmer-Selfridge with factored part 99.94%
41736*3^14500+1 is prime! (2.0989s+0.0052s)

Primality testing 41878*3^14500+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 3
Special modular reduction using all-complex FFT length 2K on 41878*3^14500+1
Calling Brillhart-Lehmer-Selfridge with factored part 99.93%
41878*3^14500+1 is prime! (1.0593s+0.0051s)

Primality testing 55492*3^14500+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 2
Special modular reduction using all-complex FFT length 2K on 55492*3^14500+1
Calling Brillhart-Lehmer-Selfridge with factored part 99.93%
55492*3^14500+1 is prime! (1.0714s+0.0083s)

Primality testing 64892*3^14500+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 2
Special modular reduction using all-complex FFT length 2K on 64892*3^14500+1
Calling Brillhart-Lehmer-Selfridge with factored part 99.93%
64892*3^14500+1 is prime! (1.0628s+0.0083s)
3.14159 is offline   Reply With Quote