DOC redocumenting

Author: eigenfoo

Diff for: euler005.hs

@@ -3,7 +3,7 @@ import Data.List
 main = print $ product $ foldl1 lcm_primes $ map prime_factors [1..20]
 
 lcm_primes :: (Eq a) => [a] -> [a] -> [a]
-lcm_primes a b = a ++ (b\\a)
+lcm_primes a b = a ++ (b \\ a)
 
 prime_factors :: (Integral a) => a -> [a]
 prime_factors 1 = []
@@ -19,4 +19,8 @@ Naive solution: (takes too long and does not scale)
 
   evenlyDivisible1_20 :: (Integral a) => a -> Bool
   evenlyDivisible1_20 n = and $ map (== 0) $ map (n `rem`) [1..20]
+
+If, unlike me at the time, you knew that lcm was a built-in function, there is
+a one-line solution:
+  main = print $ foldr1 lcm [1..20]
 -}