Summarize primes: Difference between revisions
m
→{{header|Haskell}}
m (→{{header|Haskell}}: Slight reduction: mapAccumL -> scanl) |
|||
Line 143:
indexedPrimeSums :: [(Integer, Integer, Integer)]
indexedPrimeSums =
▲ in filter (\(_, _, n) -> isPrime n) $
(\(i, _, m) p -> (succ i, p, p + m))
▲ scanl
--------------------------- TEST -------------------------
Line 154 ⟶ 153:
main =
mapM_ print $
takeWhile (\(_, p, _) -> 1000 > p) indexedPrimeSums
</lang>
{{Out}}
<pre>(1,2,2)
| |||