99-haskell-problems/Problems 31-41/problem_39.hs

8 lines
250 B
Haskell

isqrt :: (Integral n) => n -> n
isqrt = floor . sqrt . fromIntegral
isPrime :: (Integral n) => n -> Bool
isPrime n = (n >= 2) && all ((/= 0) . (n `mod`)) [2 .. isqrt n]
primesR :: (Integral n) => n -> n -> [n]
primesR m n = filter isPrime [m .. n]