Hi! I've uploaded a new code (wagstaff2.c) in google groups to test Wagstaff numbers by Anton Vrba's conjecture. It's faster than wagstaff.c from Jeff Gilchrist because I'm using bitshift+bitmask instead of the expensive divisions. For example for q=83339 it took me 127 sec. while the old code took 516 sec. on my machine, so about 4 times speed up.
To use it just give q prime as input, I've not done other cosmetics like in wagstaff.c --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "mpir-devel" group. To post to this group, send email to mpir-devel@googlegroups.com To unsubscribe from this group, send email to mpir-devel+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/mpir-devel?hl=en -~----------~----~----~----~------~----~------~--~---
