Skip to content

Instantly share code, notes, and snippets.

@rodrigosetti

rodrigosetti/gist:947841

Created April 29, 2011 04:35
Show Gist options

  • Select an option

    Learn more about clone URLs
  • Save rodrigosetti/947841 to your computer and use it in GitHub Desktop.

Select an option

Learn more about clone URLs
Save rodrigosetti/947841 to your computer and use it in GitHub Desktop.
Download ZIP
Haskell interpreter session: Beautiful Sieve of Eratosthenes to generate primes
Raw
gistfile1.hs
Prelude> let sieve (p:ps) | p > 1 = p:(sieve $ filter ((> 0) . (`mod` p)) ps)
Prelude> let primes = sieve [2..]
Prelude> take 100 primes
@rodrigosetti

rodrigosetti commented Apr 29, 2011

Copy link
Copy Markdown
Author

That last command shows the 100 first prime numbers

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment