Skip to content

Instantly share code, notes, and snippets.

@smitec
Created Oct 29, 2011
Embed
What would you like to do?
First 100 Primes in Haskell (Probably the Long Way)
(0.02 secs, 3699564 bytes)
(0.02 secs, 3699564 bytes)
[1,2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523]
(0.02 secs, 3699564 bytes)
(0.02 secs, 3699564 bytes)
[1,2] ++ (take 98 $ filter (\x -> not $ foldl (\y z -> (x `mod` z == 0) || y) False [2..round $ sqrt $ fromIntegral x]) [3,5..])
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment