RosettaCodeData/Task/Semiprime/Haskell/semiprime-1.hs
2015-02-20 09:02:09 -05:00

4 lines
210 B
Haskell

isSemiprime :: Int -> Bool
isSemiprime n = (length factors) == 2 && (product factors) == n ||
(length factors) == 1 && (head factors) ^ 2 == n
where factors = primeFactors n