leogao2/primes.hs

Created September 11, 2019 20:09

Star () You must be signed in to star a gist
Fork () You must be signed in to fork a gist

Learn more about clone URLs
Clone this repository at <script src="https://gist.github.com/leogao2/c7dc0230d44ea87e5730f11a1037fda7.js"></script>
Save leogao2/c7dc0230d44ea87e5730f11a1037fda7 to your computer and use it in GitHub Desktop.

Download ZIP

Haskell prime numbers (inefficient)

Raw

	p :: (Integral a) => a -> Bool

	p 2 = True
	p x = not (any id (map (==0) (map (mod x) (filter p [2..x-1]))))

	main = do print (take 10 (filter p [2..]))

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