Summarize primes: Difference between revisions

Content deleted Content added

Inline

@@ Line 71: / Line 71: @@
 =={{header|Haskell}}==
-<lang haskell>import Control.Monad (join)
+<lang haskell>import Data.List (mapAccumL)
-import Data.List (mapAccumL)
 import Data.Numbers.Primes (isPrime, primes)
@@ Line 81: / Line 80: @@
   let ps = primes
    in filter (\(_, _, n) -> isPrime n) $
-        zip3
+        snd $
-          [1 ..]
+          mapAccumL
+            (\a (i, p) -> let m = p + a in (m, (i, p, m)))
-          ps
-          ( snd $
-              mapAccumL
+            $ zip [1 ..] ps
-                (\n a -> join (,) (n + a))
-                ps
-          )
 --------------------------- TEST -------------------------