Thread: Double Wagstaff prime? View Single Post
2019-06-27, 01:56   #20
rogue

"Mark"
Apr 2003
Between here and the

147138 Posts

Quote:
 Originally Posted by Dylan14 Instead of trying to modify mmff to handle double Wagstaff numbers, it might be easier to modify dmdsieve from the mtsieve suite. In this case the appropriate header to pass to pfgw would be Code: ABCD 2*$a*((2^p+1)/3)+1 where$a is a k value not sieved out and p is an exponent of a Wagstaff (probable) prime. (Of course, more work is needed to get the sieve to work.)
mmff is far faster than dmdsieve for smaller exponents. I don't know if it has a limit for larger exponents. If it does, then it probably wouldn't be difficult to create a "dwdsieve".