Created
April 29, 2011 04:35
-
-
Save rodrigosetti/947841 to your computer and use it in GitHub Desktop.
Haskell interpreter session: Beautiful Sieve of Eratosthenes to generate primes
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Prelude> let sieve (p:ps) | p > 1 = p:(sieve $ filter ((> 0) . (`mod` p)) ps) | |
| Prelude> let primes = sieve [2..] | |
| Prelude> take 100 primes |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
That last command shows the 100 first prime numbers