On Fri, Dec 4, 2009 at 1:56 PM, Bill Hart <[email protected]> wrote:
> I'm not sure I understand exactly what check you did up to 2^64. Did > you take all the (composite) base 2 strong pseudoprimes and then test > that BPSW eliminates them all? If you consider that to be a reliable > result, I could use this in FLINT-Lite to give a guaranteed primality > test up to 2^64 could I not? Was there some trial factoring done > first? If so, what was the limit? Yes, I took all the composite base 2 pseudoprimes and tested them with BPSW to ensure none of them were reported as pseudoprime. We are double checking the results to make sure we didn't miss any base 2 psp's but once that is done then yes using BPSW for anything under 2^64 would be a guaranteed primality test. Are you asking if we do trial factoring first before BPSW? Nicely's BPSW code will actually try the primes < 1000 as trial prime divisors first before doing the BPSW algorithm itself. Jeff. -- You received this message because you are subscribed to the Google Groups "mpir-devel" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/mpir-devel?hl=en.
