Solution for p7 in haskell

bsiver · Aug 12, 2011 · adf1935 · adf1935
1 parent 0069b58
commit adf1935
Showing 1 changed file with 5 additions and 0 deletions.
diff --git a/p7.hs b/p7.hs
@@ -0,0 +1,5 @@
+isPrime x = not $ any divisible $ takeWhile notTooBig [2..] where
+     divisible y = x `mod`y == 0
+     notTooBig y = y*y <= x
+
+main = filter isPrime[1..1000000]!!10001