fork download 
  1. -- prime numbers
  2.  
  3. import Data.List
  4.  
  5. sieve n l [] = l
  6.  
  7. sieve n l (x:u) = sieve n (x:l) (u \\ [i * x | i <- [1..(div n x)]])
  8.  
  9. primesBelow n = sieve n [] [2..n]
  10.  
  11. -- main = do (print (primesBelow 2000))
  12.  
  13. main = do (print (sum (primesBelow 4000)))
  14.  
  15. --	print (divisors 600851475143)
  16. --	print (allPrimes !! 10000)
Success #stdin #stdout 0.59s 4620KB
comments (?)
stdin 
Standard input is empty
stdout 
1013507
https://ideone.com/UHnhz
prime numbers
language:
Haskell (ghc 8.4.4)
created:
14 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!