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

1 line
59 B
Haskell

isPrime n = n > 1 && []==[i | i <- [2..n-1], rem n i == 0]