tasks a-s

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

@@ -0,0 +1,3 @@
+factorize_ n | n > 1 = concat [divs n p | p <- [2..n], isPrime p]
+  where
+    divs n p = if rem n p==0 then p:divs (quot n p) p else []

Task/Prime-decomposition/Haskell/prime-decomposition-2.hs

@@ -0,0 +1,8 @@
+factorize n | n > 1 = go n primesList
+   where
+     go n ds@(d:t)
+        | d*d > n    = [n]
+        | r == 0     =  d : go q ds
+        | otherwise =      go n t
+            where
+              (q,r) = quotRem n d