Re: [Haskell-cafe] Looking for the fastest Haskell primes algorithm

On Tue, Apr 14, 2009 at 2:47 PM, Andrew Wagner wrote:

Some other ideas for things to put in this package possibly: is_prime :: Int -> Bool

I'd also add isProbablePrime using a Miller-Rabin test or somesuch, for use with large numbers. It'd have to be in a monad which supplies randomness, of course. But to start with, I'd just package what I had and put it on Hackage. --Max