primefactrization.hs

main = do
			print $ factorize(1000)

prime :: Int -> Bool
prime n = length([x | x <- [1..n], n `mod` x == 0 ]) == 2

primes :: Int -> [Int]
primes n = [x |  x <- [1..n], prime x]

factor :: Int -> Int -> Bool
factor x y = x `mod` y == 0

factorize :: Int -> [Int]
factorize 1 = []
factorize n =
	 let
	 	 x = head [x | x <- primes n, factor n x]
	 in
	 	x:(factorize (n `div` x))