Summarize primes: Difference between revisions

Content deleted Content added
Thebigh (talk | contribs)
Hout (talk | contribs)
m →‎{{header|Haskell}}: Slight reduction: mapAccumL -> scanl
Line 136:
 
=={{header|Haskell}}==
<lang haskell>import Data.List (mapAccumLscanl)
import Data.Numbers.Primes (isPrime, primes)
 
Line 145:
let ps = primes
in filter (\(_, _, n) -> isPrime n) $
snd $scanl
mapAccumL(\(i, _, m) p -> (succ i, p, p + m))
(\a (i, p) -> let m = p + a in (m, (i0, p0, m))0)
0ps
$ zip [1 ..] ps
 
--------------------------- TEST -------------------------