RosettaCodeData/Task/Prime-decomposition/Haskell/prime-decomposition-1.hs

6 lines
212 B
Haskell
Raw Permalink Normal View History

2023-07-01 11:58:00 -04:00
factorize n = [ d | p <- [2..n], isPrime p, d <- divs n p ]
-- [2..n] >>= (\p-> [p|isPrime p]) >>= divs n
where
divs n p | rem n p == 0 = p : divs (quot n p) p
| otherwise = []