View Single Post
Old 2006-07-28, 03:07   #27
geoff's Avatar
Mar 2003
New Zealand

13×89 Posts

Originally Posted by Citrix
I noticed that your program does not use the SPH algorithm. Do you have any plans of implementing it. It is quite straight forward. It should make your program several times faster.

It is described here
(See post by akruppa)
Thanks for the links, I will have a look at this sometime. I have a feeling the mathematics behind it is more difficult than that behind baby-steps-giant-steps though, it might take me a while.

In srsieve version 0.3.14 I have made the code recognise numbers of the form A^(2^y)+B^(2^y) as generalised Fermats, and there is a bug fix to properly handle cases where the base is a square.
geoff is offline   Reply With Quote