Primality by trial division: Difference between revisions
→Sieve by trial division: comment
(→{{header|Haskell}}: clarify, c/e) |
(→Sieve by trial division: comment) |
||
Line 1,039:
<lang haskell>primes = sieve [2..] where
sieve (p:xs) = p : sieve [x | x <- xs, mod x p /= 0]
-- (diff xs [p, p+p, ...]) would be the sieve of Eratosthenes
-- map fst . tail
-- . iterate (\(_,p:xs)-> (p, [x | x <- xs, mod x p /= 0])) $ (1, [2..])</lang>
| |||