RosettaCodeData/Task/Primality-by-trial-division/Haskell/primality-by-trial-division-1.hs
2016-12-05 22:15:40 +01:00

1 line
86 B
Haskell

isPrime n = n==2 || n>2 && all ((> 0).rem n) (2:[3,5..floor.sqrt.fromIntegral $ n+1])