Comments on Profile Post by Deep Funk

I like to use a sieve

https://en.m.wikipedia.org/wiki/Sieve_of_Eratosthenes

Then this should blow your mind: https://wiki.haskell.org/Prime_numbers

Mind that Haskell is lazy, it doesn't evaluate anything until the answer's needed.

(for the different algo's)

My house mate is a Haskell and R fanatic. He swears by them. I figured out how to do this in Python 3 with simple rules but you have to be very exact.

After years of OO, learning FP via Haskell was quite a mind-bender for me. I like the "pureness" of it, it forces you to adopt an FP mindset.

Also the syntax is pretty nice. Reads like a mathematical function. There are better places to learn about Monads though.