Summarize primes: Difference between revisions

Content deleted Content added

Inline

@@ Line 143: / Line 143: @@
 indexedPrimeSums :: [(Integer, Integer, Integer)]
 indexedPrimeSums =
+  filter (\(_, _, n) -> isPrime n) $
-  let ps = primes
+    scanl
-   in filter (\(_, _, n) -> isPrime n) $
+      (\(i, _, m) p -> (succ i, p, p + m))
-        scanl
-          (\(i, _, m) p -> (succ i, p, p + m))
+      (0, 0, 0)
-          (0, 0, 0)
+      primes
-          ps
 --------------------------- TEST -------------------------
@@ Line 154: / Line 153: @@
 main =
   mapM_ print $
-    takeWhile (\(_, p, _) -> 1000 > p) indexedPrimeSums</lang>
+    takeWhile (\(_, p, _) -> 1000 > p) indexedPrimeSums
+</lang>
 {{Out}}
 <pre>(1,2,2)