View Single Post
Old 2007-01-11, 05:43   #7
geoff
 
geoff's Avatar
 
Mar 2003
New Zealand

115710 Posts
Default

If you want to sieve the GFN's, srsieve should recognise them as such and use a faster method of sieving as long as only the terms of the form n=2^m+1 appear in the input file. If you start srsieve with the -v option it will print a message something like `filtering for primes of the form (2^m)x+1' if it has recognised the sequence as GFN. (If there are non-GFN sequences in the sieve as well then it will still notice the GFN's, but most of the benefit will be lost).
geoff is offline