2005-04-22, 06:25   #97
smh

"Sander"
Oct 2002
52.345322,5.52471

29·41 Posts

Quote:
 Originally Posted by TTn Is'nt it faster to verify bitwin primality first?
No, the remaining 4 possibilities often have small factors.

Quote:
 Originally Posted by TTn With RMA 1.75 in 2 minutes I was able to find no octoproth's for n=5000, with k<200000000.
With octo_fast it took less then 1 second to 'sieve' this range, with only 4 possible candidates left.

Code:
1297905 5000
111183135 5000
116381265 5000
176976555 5000

Last fiddled with by smh on 2005-04-22 at 06:26